#include <iostream>
#include <algorithm>
#include <vector>
#include <array>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0) -> sync_with_stdio(0);
int n, k;
cin >> n >> k;
vector<int> t(n);
for (int &i: t) cin >> i;
vector<int> diff(n - 1);
for (int i = 0; i<n - 1; ++i) {
diff[i] = t[i + 1] - t[i];
}
sort(diff.rbegin(), diff.rend());
int res = 0;
for (int i = 0; i<n - k - 1; ++i) {
res += diff[i];
}
cout << res << '\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... |