#994443 (C++14) No.2804 Fixer And Ratism

• 問題: No.2804 Fixer And Ratism
• ユーザー: Akshaj Padmakar
• 提出日時: 2024-07-12 22:37:34
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 40 ms / 2,000 ms
• コード長: 1,337 bytes
• コンパイル時間: 2,115 ms
• コンパイル使用メモリ: 184,552 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-07-12 22:37:38
• 合計ジャッジ時間: 4,257 ms
• ジャッジサーバーID （参考情報）: judge5 / judge6

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,812 KB
testcase_01	AC	1 ms; 6,816 KB
testcase_02	AC	2 ms; 6,944 KB
testcase_03	AC	14 ms; 6,944 KB
testcase_04	AC	10 ms; 6,940 KB
testcase_05	AC	5 ms; 6,940 KB
testcase_06	AC	27 ms; 6,940 KB
testcase_07	AC	8 ms; 6,940 KB
testcase_08	AC	9 ms; 6,940 KB
testcase_09	AC	3 ms; 6,944 KB
testcase_10	AC	7 ms; 6,940 KB
testcase_11	AC	25 ms; 6,940 KB
testcase_12	AC	20 ms; 6,944 KB
testcase_13	AC	7 ms; 6,940 KB
testcase_14	AC	18 ms; 6,940 KB
testcase_15	AC	3 ms; 6,944 KB
testcase_16	AC	21 ms; 6,944 KB
testcase_17	AC	9 ms; 6,944 KB
testcase_18	AC	29 ms; 6,944 KB
testcase_19	AC	3 ms; 6,944 KB
testcase_20	AC	4 ms; 6,944 KB
testcase_21	AC	30 ms; 6,940 KB
testcase_22	AC	2 ms; 6,940 KB
testcase_23	AC	38 ms; 6,940 KB
testcase_24	AC	32 ms; 6,944 KB
testcase_25	AC	40 ms; 6,940 KB
testcase_26	AC	35 ms; 6,944 KB
testcase_27	AC	33 ms; 6,944 KB
testcase_28	AC	38 ms; 6,940 KB
testcase_29	AC	35 ms; 6,944 KB
testcase_30	AC	35 ms; 6,940 KB
testcase_31	AC	32 ms; 6,944 KB
testcase_32	AC	37 ms; 6,944 KB
testcase_33	AC	2 ms; 6,944 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;

#ifndef ONLINE_JUDGE
#include "algo/debug.h"
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

#define int long long

void solve() {
	int n, q;
	cin >> n >> q;

	set<pair<int, string>> spec, nor;
	map<string, int> rat;
	while (q--) {
		int op;
		cin >> op;
		if (op == 1) {
			string s; int r;
			cin >> s >> r;
			nor.insert({r, s});
			rat[s] = r;
		} else if (op == 2) {
			int x; cin >> x;
			n -= x;
		} else {
			string s;
			int x;
			cin >> s >> x;
			n += x;

			auto it = (nor.find({rat[s], s}));

			if (it != nor.end()) {
				nor.erase(it);
			}
			spec.insert({rat[s], s});

		}
		n = min(n, (int)1e9);
		set<pair<int, string>> ans;
		while (nor.size() + spec.size() > n) {
			if (nor.size()) {
				ans.insert(*nor.begin());

				nor.erase(nor.begin());
			} else if (spec.size()) {
				ans.insert(*spec.begin());

				spec.erase(spec.begin());
			}
		}
		for (auto &x : ans) {
			cout << x.second << "\n";
		}
	}
}

signed main() {
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#else
#endif
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

	int t = 1;
	//cin >> t;

	while (t--) {
		solve();
	}

	// cerr << "Time elapsed: " << ((long double)clock() / CLOCKS_PER_SEC) << " s.\n";
}