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
const int N = 100005;
int a[N];
signed main() {
// freopen("in" , "r", stdin );
cin.tie(0)->sync_with_stdio(0);
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> v;
for (int i = 2; i <= n; i++) {
v.push_back(a[i] - a[i - 1] - 1);
}
sort(v.begin(), v.end(), greater<int>());
int ans = a[n] + 1 - a[1];
for (int i = 0; i < k - 1; i++) {
ans -= v[i];
}
cout << ans << '\n';
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |