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 arr[100010];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k, ans = 0;
cin >> n >> k;
for(int i = 0; i < n; i++){
cin >> arr[i];
}
sort(arr, arr + n);
vector <int> w;
int cur = arr[0], fir = arr[0], cnt = 1;
for(int i = 1; i < n; i++){
if(arr[i] - cur <= 1) cur = arr[i];
else{
ans += (cur - fir + 1);
cnt++;
w.push_back({arr[i] - cur - 1});
cur = fir = arr[i];
}
}
ans += (cur - fir + 1);
sort(w.begin(), w.end());
for(int i = 0; i < (cnt - k); i++){
ans += w[i];
}
cout << ans;
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... |