#include <bits/stdc++.h>
using i64 = long long;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int n, k;
std::cin >> n >> k;
std::vector<int> t(n);
for (int i = 0; i < n; i++) {
std::cin >> t[i];
}
i64 ans = t[n - 1] - t[0] + 1;
for (int i = 0; i < n - 1; i++) {
t[i] = t[i + 1] - t[i] - 1;
}
std::sort(t.begin(), t.begin() + n - 1, std::greater());
for (int i = 0; i < k - 1; i++) {
ans -= t[i];
}
std::cout << ans;
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... |