제출 #618021

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
618021		as111	Stove (JOI18_stove)	C++14	100 / 100	83 ms	6360 KiB

stove

#include <iostream>
#include <set>
#define MAXN 100000

using namespace std;
int vst[MAXN + 1];
multiset<int> tms; // set of all time between each visits, greatest to least
int main() {
	int N, K;
	cin >> N >> K;
	for (int i = 0; i < N; i++) {
		cin >> vst[i];
	}
	for (int i = 1; i < N; i++) {
		int between = vst[i] - vst[i - 1] - 1; // -1 to account for end time
		tms.insert(-between); // negative to sort greatest to smallest
	}
	int total = vst[N-1] + 1 - vst[0]; // total time if only 1 candle used
	int used = 1; // start with only 1 candle used for all visits
	set<int>::iterator it;
	for (it = tms.begin(); it != tms.end(); it++) {
		if (used == K) break;
		total += *it;
		used++;
	}
	cout << total;

}

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