제출 #941255

#제출 시각아이디문제언어결과실행 시간메모리
941255karpatkaStove (JOI18_stove)C++17
100 / 100
19 ms2384 KiB
#include <bits/stdc++.h>

using i64 = long long;

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	int n, k;
	std::cin >> n >> k;

	std::vector<int> t(n);
	for (int i = 0; i < n; i++) {
		std::cin >> t[i];
	}

	std::priority_queue<int> pq;
	for (int i = 0; i < n - 1; i++) {
		pq.push(t[i + 1] - t[i] - 1);
	}

	int ans = t[n - 1] - t[0] + 1;
	for (int i = 0; i < k - 1; i++) {
		ans -= pq.top();
		pq.pop();
	}
	std::cout << ans << '\n';

	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...