#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, k, res = 0, t[N], d[N];
int32_t main(){
cin.tie(0)->sync_with_stdio(0);
// #define task "test"
// if(fopen(task ".inp", "r")){
// freopen(task ".inp", "r", stdin);
// freopen(task ".out", "w", stdout);
// }
cin >> n >> k;
for(int i = 1; i <= n; i++) cin >> t[i];
for(int i = 1; i < n; i++) d[i] = t[i + 1] - t[i];
sort(d + 1, d + n);
for(int i = 1; i <= n - k; i++) res += d[i];
cout << res + k << "\n";
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... |