# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
252616 | ChrisT | Stove (JOI18_stove) | C++17 | 36 ms | 2048 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 main () {
int n,k;
scanf("%d %d", &n, &k);
vector<int> v(n);
for (auto &au : v) scanf("%d", &au);
int ans = v[n-1] - v[0] + 1;
vector<int> go(n-1);
for (int i = 0; i + 1 < n; i++) go[i] = v[i+1] - v[i];
sort(go.rbegin(),go.rend());
for (int i = 0; i + 1 < k; i++) ans -= go[i] - 1;
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... |