제출 #442966

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
442966		dutch	Hiring (IOI09_hiring)	C++17	61 / 100	384 ms	26972 KiB

hiring

#include <bits/stdc++.h>
using namespace std;
#define int long long
 
int n, w, j, s;
array<int, 2> res, c;
 
signed main(){
	cin.tie(0)->sync_with_stdio(0);
	cin >> n >> w;
	array<int, 3> a[n];
	for(auto &i : a){
		cin >> i[0] >> i[1];
		i[0] = (w * i[1]) / -i[0];
		i[2] = ++j;
	}

	sort(a, a+n);
 
	priority_queue<int> q;
	priority_queue<array<int, 2>> r;
 
	for(auto &i : a){
		q.push(i[1]);
		s += i[1];
		while(s > -i[0]) s -= q.top(), q.pop();
		res = max(res, {(int)q.size(), s/i[0]});
	}
 
	vector<int> ans = {res[0]};
	s = 0;
	for(auto &i : a){
		r.push({i[1], i[2]});
		s += i[1];
		while(s > -i[0]) s -= r.top()[0], r.pop();
		if(res == (c = {(int)r.size(), s/i[0]})){
			while(!r.empty()) ans.push_back(r.top()[1]), r.pop();
			break;
		}
	}
 
	for(int i : ans) cout << i << '\n';
}

• Subtask 1: 20 / 30
• Subtask 2: 20 / 28
• Subtask 3: 3 / 6
• Subtask 4: 3 / 6
• Subtask 5: 3 / 6
• Subtask 6: 3 / 6
• Subtask 7: 3 / 6
• Subtask 8: 3 / 6
• Subtask 9: 3 / 6