제출 #104600

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
104600		DMCS	Kisik (COCI19_kisik)	C++14	90 / 90	447 ms	36648 KiB

kisik

#include <bits/stdc++.h>

using namespace std;

#define int int64_t
#define w first 
#define h second 
typedef pair<int, int> rect;
const int N = 1e6;

bool cmp(rect r1, rect r2) {
	return r1.h < r2.h;
}

rect b[N];
priority_queue<int> wd;

signed main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int n, k;
	cin >> n >> k;
	for(int i = 0; i < n; i++) cin >> b[i].w >> b[i].h;
	sort(b, b+n, cmp);
	int ans, temp = 0;
	for(int i = 0; i < k-1; i++) {
		temp += b[i].w;
		wd.push(b[i].w);
	} 
	ans = (temp + b[k-1].w) * b[k-1].h; 
	for(int i = k; i < n; i++) {
		temp += b[i-1].w;
		wd.push(b[i-1].w);
		temp -= wd.top();
		wd.pop();
		int s = (temp + b[i].w) * b[i].h;
		ans = min(ans, s);
	} 
	cout << ans;
}  

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10