# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1005470 | jamjanek | Stove (JOI18_stove) | C++14 | 21 ms | 2388 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;
int a[100010], b[100010];
int main()
{
int n, k, i;
scanf("%d%d", &n, &k);
for(i=0;i<n;i++)
scanf("%d", &a[i]);
sort(a, a+n);
for(i=0;i<n-1;i++)b[i] = -(a[i+1]-a[i]-1);
sort(b, b+n-1);
int res = a[n-1]-a[0]+1;
for(i=0;i<k-1;i++)res+=b[i];
printf("%d\n", res);
}
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... |