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;
const int maxn = 1e5 + 5;
int n, k;
int a[maxn];
void solve() {
cin >> n >> k;
vector<int> b;
for(int i = 1; i <= n; ++i) {
cin >> a[i];
}
for(int i = 1; i < n; ++i) {
b.push_back(a[i] - a[i + 1]);
}
sort(b.begin(), b.end());
long long ans = a[n] - a[1] + k;
for(int i = 0; i < k - 1; ++i) {
ans += b[i];
}
cout << ans;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
solve();
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... |