Submission #1109201

#	Time	Username	Problem	Language	Result	Execution time	Memory
1109201		dsyz	Hiring (IOI09_hiring)	C++17	0 / 100	304 ms	44872 KiB

hiring

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define MAXN (1000005)
int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);
	ll N;
	ld W;
	cin>>N>>W;
	ld S[N], Q[N]; //min salary, qualification
	pair<pair<ld,ld>,ld> arr[N];
	for(ll i = 0;i < N;i++){
		cin>>S[i]>>Q[i];
		arr[i] = {{Q[i],S[i]},i};
	}
	sort(arr,arr + N);
	ld budget = W;
	ld prev = 0;
	ll ans = 0;
	for(ll i = 0;i < N;i++){
		ld needed = arr[i].first.second;
		if(i > 0){
			needed = max(needed,(arr[i].first.first / arr[i - 1].first.first) * prev);
		}
		if(budget >= needed){
			budget -= needed;
			prev = needed;
			ans++;
		}else{
			break;
		}
	}
	cout<<ans<<'\n';
}

• Subtask 1: 0 / 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