#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> t(n);
for (int i = 0; i < n; i++) cin >> t[i];
sort(t.begin(), t.end());
vector<int> gaps;
for (int i = 0; i < n - 1; i++) {
int gap = t[i + 1] - t[i] - 1;
if (gap > 0) gaps.push_back(gap);
}
sort(gaps.rbegin(), gaps.rend());
int total = t[n - 1] + 1 - t[0];
for (int i = 0; i < k - 1 && i < gaps.size(); i++) {
total -= gaps[i];
}
cout << total << 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... |