(이진 검색 트리)7662 이중 우선순위 큐

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

7662번: 이중 우선순위 큐

 

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<queue>
#include<set>


using namespace std;


multiset<int> ms;
int main() {
    cin.tie(NULL);
    cin.sync_with_stdio(false);
    cout.tie(NULL);
  
    int T;
    cin >> T;
    while (T--) {
        int k;
        cin >> k;
       
        while (k--) {
            char doing = 'A';
            cin >> doing;
            if (doing == 'D') {
                int num;
                cin >> num;
                if (ms.empty()) continue;
                if (num == 1) ms.erase(prev(ms.end()));
                else ms.erase(ms.begin());
            }
            else {
                int num;
                cin >> num;
                ms.insert(num);
            
            }
        
        }
        
        if (ms.empty())cout << "EMPTY\n";
        else {
            cout << *prev(ms.end()) << " " << *ms.begin() << "\n";
        }
        ms.clear();
    
    }
    
    return 0;

}