Submission #748828

#	Time	Username	Problem	Language	Result	Execution time	Memory
748828		aaargh	Hiring (IOI09_hiring)	C++17	5 / 100	1584 ms	42344 KiB

hiring

#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
#define int long long
#define io ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

signed main() {
	io; int n, w;
	cin >> n >> w;
	int s[n], q[n];
	for (int i = 0; i < n; i++) {
		cin >> s[i] >> q[i];
	}

	double cost;
	double ans;
	vector<int> fiine;
	vector<int> fiine2;
	double global_max = 0;
	double temp = 0;
	multiset<pair<double,int>> v;
	for (int i = 0; i < n; i++) {
		cost = s[i];
		ans = 1;
		v.clear();
		fiine.clear();
		fiine.push_back(i+1);
		// set i as being paid s[i] and take it by default
		for (int j = 0; j < n; j++) {
			if (i == j) continue;
			temp = (q[j]/q[i])*s[i];
			if (temp >= s[j]) v.insert({temp,j+1});
		}


		for (auto e: v) {
			if (cost+e.first <= w) {
				ans++;
				cost += e.first;
				fiine.push_back(e.second);
				// cerr << "pushing back " << e.second << nl;
			} else break;
		}
		global_max = max(global_max, ans);
		if (global_max == ans) {
			fiine2 = fiine;
			// cerr << "hi i am here "<< nl;
		}

	}
	cout << global_max << nl;
	for (int i = 0; i < global_max; i++) cout << fiine2[i] << nl;


}

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