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 ll long long
#define MAX 100003
using namespace std;
int n, k, t[MAX];
int main() {
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin>>n>>k;
vector <int> e;
for (int i = 1; i <= n; ++i) {
cin >> t[i];
if (i > 1) e.push_back(t[i] - t[i - 1] - 1);
}
sort(e.rbegin(), e.rend());
int ans = t[n] + 1 - t[1];
for (int i = 0; i < min(((int)e.size()), k - 1); ++i) ans -= e[i];
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... |