# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1211043 | namhh | Stove (JOI18_stove) | C++20 | 0 ms | 0 KiB |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+1;
int a[N],n,k,b[N];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
for(int i = 1; i <= n; i++) cin >> a[i];
for(int i = 1; i < n; i++) b[i] = a[i+1]-a[i];
sort(a+1,a+n+1);
int sum = a[n]-a[1]+1;
sort(b+1,b+n);
for(int i = n-1; i >= n-k+1; i--) sum -= (b[i]-1);
cout << sum;
}