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;
int main(){
int n,k;
cin>>n>>k;
int a[n];
for (int i=0;i<n;i++)cin>>a[i];
priority_queue <int> q;
for (int i=1;i<n;i++)q.push(-(a[i]-a[i-1]-1));
int ans=n;
for (int i=n;i>k;i--){
ans-=q.top();
q.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... |