Submission #349572

#	Time	Username	Problem	Language	Result	Execution time	Memory
349572		Farrius	Stove (JOI18_stove)	C++11	100 / 100	59 ms	2408 KiB

stove

#include <bits/stdc++.h>

using namespace std;

int main () {
	int n, k;
	cin >> n >> k;
	int ar[n];
	for (int i = 0; i < n; i++) {
		cin >> ar[i];
	}
	sort(ar, ar + n);
	priority_queue<int> segments;
	int sol = n;
	for (int i = 1; i < n; i++) {
		int cur = ar[i] - ar[i - 1] - 1;
		segments.push(cur);
		sol += cur;
	}
	k--;
	while (k-- && !segments.empty()) {
		sol -= segments.top();
		segments.pop();
	}
	cout << sol << '\n';
}

• Subtask 1: 20 / 20
• Subtask 2: 30 / 30
• Subtask 3: 50 / 50