L2-046 天梯赛的赛场安排

PTA | 程序设计类实验辅助教学平台 (pintia.cn)

#include <iostream>
#include <string>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;

typedef pair<int, int> PII;
set<PII> s;
vector<string> vis;
vector<int> ans, arena;

int main() {
    int n, c, cnt = 0;
    cin >> n >> c;
    vis.resize(n);
    ans.resize(n, 0);
    for (int i = 0, a; i < n; i++) {
        cin >> vis[i] >> a;
        s.insert(PII(-a, i));
    }
    while (!s.empty()) {
        int a  = -s.begin()->first;
        int id = s.begin()->second;
        ans[id] += 1;
        s.erase(s.begin());
        if (a >= c) {
            cnt++;
            if (a == c) continue;
            s.insert(PII(c - a, id));
        }
        else {
            int pos = -1;
            for (int i = 0; i < arena.size(); i++) {
                if (c - arena[i] >= a) {
                    pos = i;
                    break;
                }
            }
            if (pos == -1) arena.push_back(a);
            else arena[pos] += a;
        }
    }
    for (int i = 0; i < n; i++) {
        cout << vis[i] << " " << ans[i] << endl;
    }
    cout << cnt + arena.size();
    return 0;
}