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
int32_t main()
{
cin.tie(0)->sync_with_stdio(0);
int n, k;
cin >> n >> k;
vector<int> t(n + 1);
for(int i = 1; i <= n; i++) {
cin >> t[i];
}
vector<int> gr;
for(int i = 1; i + 1 <= n; i++) {
gr.emplace_back(t[i + 1] - t[i]);
}
sort(gr.rbegin(), gr.rend());
int ans = t[n] - t[1] + k;
for(int i = 0; i < k - 1; i++) {
ans -= gr[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... |