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;
struct s {
int dif;
int l;
int r;
};
bool comp(s a, s b) {
if (a.dif == b.dif) {
return a.l < b.l;
}
return a.dif > b.dif;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<int> v(n);
for (auto &e:v) cin >> e;
vector<s> vs;
if (n == 1) {
cout << 1;
return 0;
}
if (k == 1) {
cout << v[n-1] + 1 - v[0];
return 0;
}
for (int i=0; i<n - 1; i++) {
int DIF = v[i+1] - v[i], L = i, R = i+1;
vs.push_back({DIF,L,R});
}
sort(vs.begin(),vs.end(),comp);
vector<pair<int,int>> vp;
for (int i=0; i<k-1; i++) {
int fi = vs[i].l, se = vs[i].r;
vp.push_back({fi,se});
}
sort(vp.begin(),vp.end());
ll ans = 0;
int cur = 0;
for (int i=0; i<k-1; i++) {
ll rh = v[vp[i].first] + 1;
ans += (rh - cur);
cur = v[vp[i].second];
}
ans += (v[n - 1] - cur);
cout << ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |