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