This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*
author: lunchbox
problem link: https://oj.uz/problem/view/JOI18_stove
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int n, k; cin >> n >> k;
vector<int> a(n);
for (int& x : a) cin >> x;
int ans = a.back() - a[0] + 1;
for (int i = 0; i < n - 1; i++)
a[i] = a[i + 1] - a[i];
a.pop_back();
sort(a.rbegin(), a.rend());
for (int i = 0; i < k - 1; i++) ans -= a[i] - 1;
cout << ans << '\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... |