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 main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<int> a(n);
for(int& i : a) {
cin >> i;
}
priority_queue<int> q;
q.push(0);
ll ans = n;
for(int i = 1; i < n; i++) {
int len = a[i] - a[i-1] - 1;
q.push(len);
ans += len;
}
for(int i = 0; i < k-1; i++) {
ans -= q.top();
q.pop();
}
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... |