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 ll long long
int main() {
ll n, t;
cin >> n >> t;
vector<ll> a(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> gap(n - 1);
for(int i = 1; i < n; i++) {
gap[i - 1] = a[i] - a[i - 1] - 1;
}
sort(gap.begin(), gap.end(), greater<int>());
int ans = a[n - 1] - a[0] + 1;
for(int i = 0; i < t - 1; i++) {
ans -= gap[i];
}
cout << ans << endl;
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... |