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;
using ll = long long;
int a[100100];
int b[100100];
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
int n, k;
cin >> n >> k;
for (int i = 1;i <= n;i++) {
cin >> a[i];
}
for (int i = 1;i < n;i++) {
b[i] = a[i + 1] - a[i];
}
sort(b + 1, b + n, greater<int>());
int mn = a[n] - a[1] + 1;
int now = a[n] - a[1] + 1;
for (int i = 2;i <= k;i++) {
now -= b[i - 1];
now++;
mn = min(mn, now);
}
cout << mn << '\n';
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... |