# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
154329 | ivandasfs | Stove (JOI18_stove) | C++14 | 30 ms | 2144 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 <iostream>
#include <algorithm>
using namespace std;
int a[100005];
int b[100005];
int main() {
int n, k;
scanf("%d%d", &n, &k);
int sol = n;
for (int i=0 ; i<n ; i++) {
scanf("%d", a+i);
}
sort(a, a+n);
for (int i=0 ; i<n-1 ; i++) {
b[i] = a[i+1] - a[i] - 1;
}
sort(b, b+n-1);
for (int i=0 ; i<n-k ; i++) {
sol += b[i];
}
printf("%d\n", sol);
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... |