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 n, k;
int t[MXN];
signed main() {
cin >> n >> k;
for (int i=0; i<n; i++) cin >> t[i];
sort(t, t+n);
int full = t[n-1] + 1 - t[0];
k--;
vector<int> gaps;
for (int i=1; i<n; i++) {
gaps.push_back(t[i] - t[i-1] - 1);
}
sort(gaps.begin(), gaps.end(), greater<int>());
int ove = 0;
for (int i=0; i<min((int) gaps.size(), k); i++) ove += gaps[i];
cout << full - ove << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |