제출 #207605

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
207605		dolphingarlic	Hiring (IOI09_hiring)	C++14	100 / 100	465 ms	12944 KiB

hiring

#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

struct Worker {
    int s, id;
    double ratio;
};
bool operator<(Worker A, Worker B) {
    if (A.s == B.s) return A.ratio < B.ratio;
    return A.s < B.s;
}
bool cmp(Worker A, Worker B) {
    if (A.ratio == B.ratio) return A.s < B.s;
    return A.ratio < B.ratio;
}

Worker workers[500001];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    ll m;
    cin >> n >> m;
    FOR(i, 0, n) {
        int s, q;
        cin >> q >> s;
        workers[i] = {s, i + 1, (double)q / s};
    }
    sort(workers, workers + n, cmp);

    int best_pos = -1, mx_workers = 0;
    double best_pay = 1e18;

    priority_queue<Worker> pq;
    ll sm = 0;
    FOR(i, 0, n) {
        pq.push(workers[i]);
        sm += workers[i].s;
        while (sm * workers[i].ratio > m) {
            sm -= pq.top().s;
            pq.pop();
        }

        if (pq.size() > mx_workers) {
            mx_workers = pq.size();
            best_pay = sm * workers[i].ratio;
            best_pos = i;
        } else if (pq.size() == mx_workers && sm * workers[i].ratio < best_pay) {
            best_pay = sm * workers[i].ratio;
            best_pos = i;
        }
    }

    while (pq.size()) pq.pop();
    sm = 0;
    FOR(i, 0, n) {
        pq.push(workers[i]);
        sm += workers[i].s;
        while (sm * workers[i].ratio > m) {
            sm -= pq.top().s;
            pq.pop();
        }

        if (i == best_pos) {
            cout << mx_workers << '\n';
            while (pq.size()) {
                cout << pq.top().id << '\n';
                pq.pop();
            }
            return 0;
        }
    }
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

hiring.cpp: In function 'int main()':
hiring.cpp:47:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (pq.size() > mx_workers) {
             ~~~~~~~~~~^~~~~~~~~~~~
hiring.cpp:51:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         } else if (pq.size() == mx_workers && sm * workers[i].ratio < best_pay) {
                    ~~~~~~~~~~^~~~~~~~~~~~~

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