(c++) 백준 "7662_우선순위_큐"

https://www.acmicpc.net/problem/7662

7662번: 이중 우선순위 큐

---

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <limits.h>

using namespace std;
int main() {
	int T; cin >> T;
	for (int t = 0; t < T; t++) {
		int N; cin >> N;
		map<int, int> m;
		for (int i = 0; i < N; i++) {
			char c; cin >> c;
			int num; cin >> num;
			if (c == 'I') {
				m[num]++;
			}
			else if (c == 'D' && m.size() > 0) {
				if (num < 0) {
					m.begin()->second -= 1;
					if (m.begin()->second == 0) {
						m.erase(m.begin()->first);
					}
				}
				else{
					(--m.end())->second -= 1;
					if ((--m.end())->second == 0) {
						m.erase((--m.end())->first);
					}
				}
			}
		}
		int maxest = INT_MIN;
		int minest = INT_MAX;
		if (m.size() > 0) {
			minest = m.begin()->first;
			maxest = (--m.end())->first;
			cout << maxest << " " << minest << endl;
		}
		else {
			cout << "EMPTY" << endl;
		}
	}
	return 0;
}