제출 #990101

#제출 시각아이디문제언어결과실행 시간메모리
990101NewtonabcStove (JOI18_stove)C++14
100 / 100
35 ms2408 KiB
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int arr[N];
priority_queue<int> q;
int main(){
	int n,m,ans,prev;
	cin>>n >>m;
	for(int i=1;i<=n;i++) cin>>arr[i];
	prev=arr[1];
	for(int i=2;i<=n;i++){
		q.push(arr[i]-prev-1);
		prev=arr[i];
	}
	ans=arr[n]-arr[1]+1;
	int cnt=1;
	while(cnt<m){
		ans-=q.top();
		q.pop();
		cnt++;
	}
	cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...