# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
338284 | markussie | Stove (JOI18_stove) | C++17 | 29 ms | 2156 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 <cstdio>
#include <algorithm>
using namespace std;
const int mxn = 1e5;
int a[mxn+1];
int d[mxn+1];
int main()
{
int n, k;
scanf("%d%d", &n, &k);
for(int i = 0; i < n; ++i)
scanf("%d", &a[i]);
sort(a, a + n);
long long ans = a[n-1] - a[0] + 1;
for(int i = 1; i < n; ++i)
d[i-1] = a[i] - a[i-1] - 1;
sort(d, d + n-1);
for(int i = 1; i < k; ++i)
ans -= d[n-1-i];
printf("%lld", 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... |