Submission #729348

#TimeUsernameProblemLanguageResultExecution timeMemory
729348pccStove (JOI18_stove)C++14
100 / 100
24 ms2260 KiB
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pll pair<ll,ll>
#define fs first
#define sc second


void solve(){
	ll n,k;
	cin>>n>>k;
	k--;
	ll arr[n];
	for(auto &i:arr)cin>>i;
	sort(arr,arr+n);
	priority_queue<ll,vector<ll>,less<ll>> pq;
	pq.push(0);
	ll total = arr[n-1]-arr[0]+1;
	for(int i = 1;i<n;i++)pq.push(arr[i]-arr[i-1]-1);
	while(k--){
		total -= pq.top();
		pq.pop();
	}
	cout<<total;
}
int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int t = 1;
	while(t--)solve();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...