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;
const int N = 100005;
int n, k;
int t[N];
vector<int> gaps;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> t[i];
if (i > 1) {
gaps.emplace_back(t[i] - t[i - 1] - 1);
}
}
int ans = t[n] - t[1] + 1;
sort(gaps.begin(), gaps.end());
--k;
while (k--) {
ans -= gaps.back();
gaps.pop_back();
}
cout << ans;
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... |