제출 #538726

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
538726		fabijan_cikac	Hiring (IOI09_hiring)	C++17	60 / 100	894 ms	29808 KiB

hiring

#include <bits/stdc++.h>

using namespace std;

#define F first
#define S second
#define db double
#define pp pair<db, db>
#define ppp pair<db, pp>

int n; db w;
vector<db> sk;
vector<db> q;
vector<pair<db, int> > v;
set<pair<db, int> > s;
int siz = 0;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> w;
    sk.resize(n); q.resize(n);
    for (int i = 0; i < n; ++i){
        cin >> sk[i] >> q[i];
        v.push_back({sk[i] / q[i], i});
    }
    sort(v.begin(), v.end()); db sum = 0;
    for (int i = 0; i < n; ++i){
        s.insert({q[v[i].S], v[i].S}); sum += q[v[i].S];
        while (!s.empty() && sum * v[i].F > w){
            auto it = s.end(); --it;
            sum -= (*it).F; s.erase(it);
        }
        siz = max(siz, (int)(s.size()));
    }
    cout << siz << '\n'; s.clear(); sum = 0;
    for (int i = 0; i < n; ++i){
        s.insert({q[v[i].S], v[i].S}); sum += q[v[i].S];
        while (!s.empty() && sum * v[i].F > w){
            auto it = s.end(); --it;
            sum -= (*it).F; s.erase(it);
        }
        if (siz == (int)(s.size())){
            for (auto x: s)
                cout << (x.S + 1) << '\n';
            break;
        }
    }

    return 0;
}

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