#994065 (C++23) No.2804 Fixer And Ratism

• 問題: No.2804 Fixer And Ratism
• ユーザー: kwm_t
• 提出日時: 2024-07-12 21:32:42
• 言語: C++23 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 33 ms / 2,000 ms
• コード長: 1,928 bytes
• コンパイル時間: 3,465 ms
• コンパイル使用メモリ: 265,124 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-12 21:32:50
• 合計ジャッジ時間: 5,496 ms
• ジャッジサーバーID （参考情報）: judge4 / judge6

ファイルパターン	結果
sample	AC * 3
other	AC * 31

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, q; cin >> n >> q;
    struct data {
        string name;
        int rate = 0;
        bool fix = false;
        bool ex = false;
        data(string name = "", int rate = 0, bool fix = false, bool ex = false) :
            name(name), rate(rate), fix(fix), ex(ex) {}
    };
    vector<data>d;
    while (q--) {
        int t; cin >> t;
        if (1 == t) {
            string s;
            int r; cin >> s >> r;
            d.push_back(data(s, r, false, true));
        }
        else if (2 == t) {
            int x; cin >> x;
            n -= x;
        }
        else {
            string s;
            int x;
            cin >> s >> x;
            n += x;
            rep(i, d.size()) {
                if (s == d[i].name) {
                    d[i].fix = true;
                    break;
                }
            }
        }
        if (n >= d.size())continue;
        std::sort(d.begin(), d.end(), [](data l, data r) {
            if (l.fix == r.fix)return l.rate > r.rate;
            return l.fix > r.fix;
            }
        );
        vector<data>out;
        int num = max(0, (int)d.size() - n);
        rep(i, num) {
            out.push_back(d.back());
            d.pop_back();
        }
        std::sort(out.begin(), out.end(), [](data l, data r) {
            return l.rate < r.rate; }
        );
        rep(i, out.size())cout << out[i].name << endl;
    }
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX