Submission #1314921

#TimeUsernameProblemLanguageResultExecution timeMemory
1314921exoworldgdHiring (IOI09_hiring)C++20
0 / 100
105 ms8248 KiB
#include <bits/stdc++.h>
#define exoworldgd cin.tie(0)->sync_with_stdio(0),cout.tie(0)
using namespace std;
int n,w,s,q,mx=-1,sum=0;
tuple<double,int,int> a[500005];
signed main(void) {
    exoworldgd;
    cin >> n >> w;
    for (int i = 0; i < n; i++) cin >> s >> q, a[i] = {s*1.0/q,s,q};
    sort(a,a+n);
    priority_queue<int> pq;
    for (int i = 0; i < n; i++) {
        pq.push(get<2>(a[i])),sum += get<2>(a[i]);
        while (!pq.empty() && get<1>(a[i])*sum > w*get<2>(a[i])) sum -= pq.top(), pq.pop();
        mx = max(mx,(int)pq.size());
    }
    cout << mx;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...