Submission #754577

#TimeUsernameProblemLanguageResultExecution timeMemory
754577dzdzxStove (JOI18_stove)C++17
100 / 100
53 ms1312 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...