#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
int n,k,a;
vector<int> gaps;
cin >> n >> k;
int last = -1;
while (n--) {
cin >> a;
if (last == -1) {
last = a+1;
} else {
gaps.push_back(a-(last));
}
last = a + 1;
}
sort(gaps.begin(),gaps.end(),greater<int>());
k-=1;
for (int i = 0; i <k;i++){
a -= gaps[i];
}
cout << a << "\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |