제출 #202487

#제출 시각아이디문제언어결과실행 시간메모리
202487YojahuangStove (JOI18_stove)C++14
100 / 100
31 ms2420 KiB
#include<bits/stdc++.h>
using namespace std;
using ll = long long;

const int MAXN = 100005;

int n, k, in[MAXN];
vector<int> G;

int main(){
	ios::sync_with_stdio(0),cin.tie(0);
	int ret;
	while (cin >> n >> k) {
		G.clear();
		k--;
		for (int i = 0; i < n; ++i) {
			cin >> in[i];
			if (i) G.push_back(in[i] - in[i-1] - 1);
		}
		ret = in[n-1] - in[0] + 1;
		sort(G.begin(), G.end(), greater<int>());
		for (int i = 0; i < k; ++i) {
			ret -= G[i];
		}
		cout << ret << '\n';
	}
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...