#include<bits/stdc++.h>
using namespace std;
const int N=1e5+7;
int t[N];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int n,k;cin >> n >> k;
for(int i=1; i<=n ; i++){
cin >> t[i];
}
vector<int>gap;
int tmp= t[n]-t[1]+1;
for(int i=2;i<=n;i++){
gap.push_back(t[i]-t[i-1]-1);
}
sort(gap.rbegin(),gap.rend());
for(int i=0; i<k-1 && i<=gap.size() ; i++){
tmp-=gap[i];
}
cout << tmp;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |