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;
typedef long long ll;
int N, K;
int main() {
cin.tie(0); ios_base::sync_with_stdio(0);
cin >> N >> K;
vector<int> t(N);
for(int i = 0; i < N; i++) cin >> t[i];
int ans = t.back();
vector<int> v;
for(int i = 1; i < N; i++) {
v.push_back(t[i] - t[i - 1] - 1);
}
sort(v.begin(), v.end());
while(!v.empty() && K > 1) {
ans -= v.back();
K--;
v.pop_back();
}
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... |