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;
cin >> n >> k;
int a[n+1];
vector<int> el;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (i != 1) {
el.push_back(a[i] - a[i-1] - 1);
}
}
sort(el.begin(), el.end());
reverse(el.begin(), el.end());
int sm = a[n] - a[1] + 1;
for (int i = 0; i < min(k-1, (int)el.size()); i++) {
sm -= el[i];
}
cout << sm;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |