This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//Stove(Vjudge)
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, k, ans = 0;
cin >> n >> k;
int t[n + 10];
vector <int> dist;
for(int i = 0; i < n; i++){
cin >> t[i];
}
sort(t , t + n);
for(int i = 0; i < n - 1; i++){
dist.push_back(t[i + 1] - t[i]);
}
sort(dist.begin() , dist.end());
for(int i = 0; i < n - k; i++){
ans += dist[i];
}
ans += k;
cout << ans << 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... |