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 N, K, A[100100], ans;
vector<int> v;
int main()
{
cin >> N >> K;
for(int i=1; i<=N; i++) {
cin >> A[i];
}
sort(A+1, A+N+1);
for(int i=1; i<N; i++) {
if (A[i+1] > A[i]+1) {
v.push_back(A[i+1]-A[i]-1);
}
}
sort(v.begin(), v.end(), greater<int>());
for(int i=0; i<min(K-1,(int)v.size()); i++) {
ans += v[i];
}
cout << A[N]-A[1]+1-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... |