# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
64117 | keko37 | Stove (JOI18_stove) | C++14 | 37 ms | 1908 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;
const int MAXN = 100005;
long long n, k, sol;
int l[MAXN], d[MAXN];
int main () {
cin >> n >> k;
for (int i=0; i<n; i++) {
scanf("%d", &l[i]);
if (i) d[i] = l[i] - l[i-1] - 1;
sol += d[i];
}
sort(d+1, d+n);
for (int i=0; i<k-1; i++) {
sol -= d[n-1 - i];
}
cout << sol + n;
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... |