Submission #579841

#TimeUsernameProblemLanguageResultExecution timeMemory
579841karriganStove (JOI18_stove)C++14
100 / 100
32 ms3284 KiB
#include <bits/stdc++.h>
using namespace std;
long long a[100001];
int n,k;
priority_queue<long long>b;
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    //freopen(".INP","r",stdin);
   // freopen(".OUT","w",stdout);
	cin>>n>>k;
	for (int i=1;i<=n;i++)cin>>a[i];
	for (int i=1;i<n;i++)b.push(a[i+1]-a[i]);
	long long ans=k+a[n]-a[1];
	k--;
	while (k>0&&b.empty()==false){
		ans-=b.top();
		b.pop();
		k--;
	}
	cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...