#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int &x : a) cin >> x;
sort(a.begin(), a.end());
vector<int> d;
for (int i = 1; i < n; i++) d.push_back(a[i] - a[i - 1] - 1);
sort(d.begin(), d.end(), greater<int>());
k = n - k;
while (k-- && !d.empty()) {
n += d.back();
d.pop_back();
}
cout << n << 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... |