This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e5;
int n,k,t[N+5];
void Solve(){
cin>>n>>k;
t[0]=-1;
int ans=n,d=n;
vector <int> v;
for (int i=1;i<=n;++i){
cin>>t[i];
if (i>1) v.push_back(t[i]-t[i-1]-1);
}
sort(v.begin(),v.end(),greater<int>());
while (d>k){
--d;
ans+=v.back();
v.pop_back();
}
cout<<ans;
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t=1;
// cin>>t;
while (t--) Solve();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |