#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];
}
vector<int> v;
for (int i = 0; i < N - 1; ++i) {
int g = T[i + 1] - (T[i] + 1);
v.push_back(g);
}
sort(v.begin(), v.end());
long long result = N;
for (int i = 0; i < N - K; ++i) {
result += v[i];
}
cout << result << 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... |