Submission #676535

#TimeUsernameProblemLanguageResultExecution timeMemory
676535abcdehelloStove (JOI18_stove)C++17
100 / 100
59 ms2180 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...