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;
//#define int long long
signed main () {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, k;
cin >> n >> k;
vector <int> a(n);
function <int(int, int)> good=[&](int sz, int opt) {
int prev = a[0], ans = 1, cnt = 1;
for(int i = 1; i < n; i ++) {
if((a[i] + 1) - (prev + 1) <= sz) {
ans += ((a[i] + 1) - (prev + 1));
prev = a[i];
}else {
ans += 1;
prev = a[i];
cnt ++;
}
}
if(opt == 0) {
if(cnt <= k) return 1;
return 0;
}
return ans;
};
for(int i = 0; i < n; i ++) cin >> a[i];
sort(a.begin(), a.end());
int l = 1, r = (int)1e9;
while(l < r) {
int mid = (l + r) / 2;
if(good(mid, 0)) r = mid;
else l = mid + 1;
}
cout << good(r, 1);
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... |