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> ti(n);
for(int i = 0; i < n; i++){
cin >> ti[i];
}
sort(ti.begin(), ti.end());
vector<int> gp;
for (int i = 1; i < n; i++){
gp.push_back(ti[i] - ti[i-1] - 1);
}
sort(gp.begin(), gp.end());
int tt = n;
for(int i = 0; i < n - k; i++){
tt += gp[i];
}
cout << tt << 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... |