제출 #729345

#제출 시각아이디문제언어결과실행 시간메모리
729345pccStove (JOI18_stove)C++14
0 / 100
1 ms316 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 = n-k;
	ll arr[n];
	for(auto &i:arr)cin>>i;
	priority_queue<ll,vector<ll>,less<ll>> pq;
	pq.push(0);
	ll total = arr[n-1]+1;
	for(int i = 1;i<n;i++)pq.push(arr[i]-arr[i-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...