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+10;
int arr[N];
priority_queue<int> q;
int main(){
int n,m,ans,prev;
cin>>n >>m;
for(int i=1;i<=n;i++) cin>>arr[i];
prev=arr[1];
for(int i=2;i<=n;i++){
q.push(arr[i]-prev-1);
prev=arr[i];
}
ans=arr[n]-arr[1]+1;
int cnt=1;
while(cnt<m){
ans-=q.top();
q.pop();
cnt++;
}
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... |