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>
#define endl "\n"
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
vector<int> a(n), s(n - 1);
for (int i = 0; i < n; ++i) cin >> a[i];
long long total_time = a[n - 1] - a[0] + 1;
for (int i = 0; i < n - 1; ++i) s[i] = a[i + 1] - a[i] - 1;
sort(s.begin(), s.end(), greater<int>());
for (int i = 0; i < k - 1; ++i) total_time -= s[i];
cout << total_time << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
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... |