제출 #55248

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
55248		shoemakerjo	Stove (JOI18_stove)	C++14	100 / 100	39 ms	10532 KiB

stove

#include <bits/stdc++.h>

using namespace std;

#define maxn 100010
int n, k;
int nums[maxn];

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int ans = 0;
	vector<int> diffs;
	cin >> n >> k;
	for (int i = 0; i < n; i++) {
		cin >> nums[i];
		if (i) ans += nums[i]-nums[i-1];
		if (i) diffs.push_back(nums[i]-nums[i-1]-1);
	}
	ans++; //need to be one past the end
	sort(diffs.begin(), diffs.end());
	reverse(diffs.begin(), diffs.end());
	for (int i = 0; i < k-1; i++) {
		ans -= diffs[i];
	}
	cout << ans << endl;
}

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