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;
vector<int> v(n), vd(n - 1);
for (int i = 0; i < n; i++) cin >> v[i];
for (int i = 0; i < n - 1; i++)
vd[i] = v[i + 1] - v[i] - 1;
sort(vd.rbegin(), vd.rend());
int sum = 0;
for (int i = 0; i < k - 1; i++)
sum += vd[i];
cout << *max_element(v.begin(), v.end()) - sum << endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |