제출 #817969

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
817969		Liudas	Hiring (IOI09_hiring)	C++17	47 / 100	1597 ms	15212 KiB

hiring

#include <bits/stdc++.h>
using namespace std;
struct node{
    double Q;
    double P;
    int id;
};
int main()
{
    long long N, W;
    double H = 0, BP = 1e10;
    cin >> N >> W;
    vector<node> arr(N);
    vector<int> ans;
    for(int i = 0; i < N; i ++){
        cin >> arr[i].P >> arr[i].Q;
        arr[i].id = i + 1;
    }
    for(int i = 0; i < N; i ++){
        node start = arr[i];
        double price = 0;
        double c = 0;
        sort(arr.begin(), arr.end(), [&](node a, node b){return a.Q * start.P < b.Q * start.P;});
        vector<int> brr;
        for(node j : arr){
            if(start.P * j.Q >= j.P * start.Q && (price + j.Q) * start.P <= W * start.Q){
                c ++;
                price += j.Q;
                brr.push_back(j.id);
            }
        }
        if(H < c){
            ans = brr;
            BP = price * start.P / start.Q;
        }
        else if(H == c && price * start.P / start.Q <= BP){
            ans = brr;
            BP = price * start.P / start.Q;
        }
        H = max(c, H);
    }
    cout << H << endl;
    for(int i : ans){
        cout << i << endl;
    }
    return 0;
}

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