#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m, r, x, y, i, j,j1, o1, i1, p, cnt,s,next, ans, t, z;
cin >> n >> m;
ll a[n + 2];
vector < ll > v;
for (i = 1; i <= n; i ++) {
cin >> a[i];
if ( i >= 2) v.push_back(a[i] - a[i - 1] - 1);
}
ans = a[n] + 1 - a[1];
sort(v.rbegin(), v.rend());
m --;
for (i = 0; i < m; i ++) ans = ans - (v[i]);
cout << ans << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |