# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
485754 | dongliu0426 | Stove (JOI18_stove) | C++17 | 23 ms | 1656 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define N 100000
int main() {
int n, k, ans;
static int tt[N];
scanf("%d%d", &n, &k), k--;
for (int i = 0; i < n; i++)
scanf("%d", &tt[i]);
ans = tt[n - 1] - tt[0] + 1;
for (int i = 0; i < n; i++)
tt[i] = tt[i + 1] - tt[i] - 1;
sort(tt, tt + n - 1);
for (int i = 0; i < k; i++)
ans -= tt[n - 1 - i - 1];
printf("%d\n", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |