제출 #1278606

#제출 시각아이디문제언어결과실행 시간메모리
1278606IBoryStove (JOI18_stove)C++20
100 / 100
14 ms1484 KiB
#include <bits/stdc++.h>
using namespace std;

const int MAX = 100007;
int T[MAX];

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	int N, K;
	cin >> N >> K;
	int ans = N;
	vector<int> cand;
	for (int i = 1; i <= N; ++i) cin >> T[i];
	for (int i = 1; i < N; ++i) {
		cand.push_back(T[i + 1] - T[i] - 1);
	}
	sort(cand.begin(), cand.end());
	int light = N - K;
	for (int i = 0; i < min(light, (int)cand.size()); ++i) ans += cand[i];
	cout << ans;
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...