#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
int k;
cin>>n>>k;
vector<int> t(n);
for(int i=0;i<n;i++) cin>>t[i];
int tong=n;
vector<int> kc;
for(int i=1;i<n;i++){
int kcc=t[i]-t[i-1]-1;
if(kcc>0) kc.push_back(kcc);
}
if(k>=n){
cout<<n;
return 0;
}
sort(kc.begin(),kc.end());
for(int i=0;i<n-k&&i<kc.size();i++){
tong+=kc[i];
}
cout<<tong;
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... |