#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using i64 = long long;
int const N = 1e5 + 5;
int n, k;
int T[N];
vector<int> gap;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> T[i];
}
for (int i = 0; i + 1 < n; i++) {
if (T[i] + 1 < T[i + 1]) {
gap.push_back(T[i + 1] - T[i] - 1);
}
}
sort(gap.begin(), gap.end(), greater<int>());
i64 res = T[n - 1] + 1 - T[0];
for (int i = 0; i < min(k - 1, (int)gap.size()); i++) {
res -= gap[i];
}
cout << res << '\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... |