제출 #660332

#제출 시각아이디문제언어결과실행 시간메모리
660332GoldLightStove (JOI18_stove)C++17
100 / 100
24 ms1872 KiB
#include <bits/stdc++.h>
using namespace std;
void fast(){ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);}

priority_queue<int, vector<int>, greater<int>> pq;
int main(){
	fast();
	int n, k; cin>>n>>k;
	int baru, last;
	for(int i=1; i<=n; i++){
		cin>>baru;
		if(i>1){
			pq.push(baru-last-1);
		}
		last=baru;
	}
	int ans=n;
	for(int i=1; i<=n-k; i++){
		ans+=pq.top();
		pq.pop();
	}
	cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...