제출 #467269

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
467269		BlancaHM	Stove (JOI18_stove)	C++14	100 / 100	59 ms	2028 KiB

stove

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int solve(int K, vector<int> & arrivals) {
	int N = (int) arrivals.size();
	vector<int> gapSizes(N-1);
	for (int i = 0; i < N-1; i++)
		gapSizes[i] = arrivals[i+1]-arrivals[i]-1;

	sort(gapSizes.begin(), gapSizes.end(), greater<int>());

	int answer = arrivals[N-1]+1 - arrivals[0];
	for (int i = 0; i < K-1; i++) {
		answer -= gapSizes[i];
	}
	return answer;
}

int main() {
	int N, K;
	vector<int> arrivals;
	cin >> N >> K;
	arrivals = vector<int>(N);
	for (int i = 0; i < N; i++)
		cin >> arrivals[i];
	cout << solve(K, arrivals) << '\n';
	return 0;
}

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