# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
494816 | aris12345678 | Stove (JOI18_stove) | C++14 | 27 ms | 2244 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;
const int mxN = 100005;
int a[mxN];
int main() {
int n, k;
scanf("%d %d", &n, &k);
for(int i = 0; i < n; i++)
scanf("%d", &a[i]);
vector<int> diff;
for(int i = 1; i < n; i++)
diff.push_back(a[i]-a[i-1]-1);
sort(diff.begin(), diff.end(), greater<int>());
int ans = a[n-1]-a[0]+1;
for(int i = 0; i < k-1; i++)
ans -= diff[i];
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... |