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 = 16000;
int main() {
int n, k; cin >> n >> k;
vector<int> times(n);
for(auto &x:times) cin >> x;
vector<int> values;
for(int i=1; i<n; ++i) values.push_back(times[i]-times[i-1]-1);
sort(values.rbegin(), values.rend());
int total=times[n-1]-times[0]+1;
for(int i=0; i<k-1; ++i) total-=values[i];
cout << total << "\n";
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... |