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>
using namespace std;
const int N=1e5+5;
int n,k,ans,t,t1;
priority_queue<int>v;
int main(){
cin>>n>>k;
cin>>t1;
ans=t1;
for(int i=0;i<n-1;i++){
cin>>t;
v.push(t-t1-1);
t1=t;
}
ans=t-ans+1;
k--;while(k--){
ans-=v.top();
v.pop();
}
cout<<ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |