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
signed main()
{
int n, k; cin >> n >> k;
vector<int> a(n);
vector<int> gaps;
for (int i = 0; i < n; i++){
cin >> a[i];
}
int ans = a[n - 1] + 1 - a[0];
for (int i = 1; i < n; i++){
gaps.push_back(a[i] - (a[i - 1] + 1));
}
sort(gaps.begin(), gaps.end());
reverse(gaps.begin(), gaps.end());
for (int i = 0; i < k - 1; i++){
ans -= gaps[i];
}
cout << ans << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |