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 n,k,t[100050],cnt,ans;
priority_queue<int,vector<int>,greater<int> > heap;
int main(){
cin >> n >> k;
cnt=ans=n;
for (int i=1;i<=n;i++){
cin >> t[i];
if (i>1) heap.push(t[i]-t[i-1]-1);
}
while (cnt>k){
int nxt=heap.top();
heap.pop();
cnt--;
ans+=nxt;
}
cout << ans << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |