Baekjoon #7662

#include<bits/stdc++.h>

using namespace std;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t; cin >> t;
    while(t--) {
        map<int, int> mp;
        int n; cin >> n;
        for(int i=0;i<n;i++) {
            char cmd; cin >> cmd;
            int x;cin >> x;
            
            if(cmd == 'I') {
                mp[x] += 1;
            }
            else {
                if(mp.empty()) continue;
                if(x == -1) {
                    if(mp.begin()->second == 1) {
                        mp.erase(mp.begin()->first);
                    }
                    else {
                        mp.begin()->second --;
                    } 
                }
                else {
                    if(mp.rbegin()->second == 1) {
                        mp.erase(mp.rbegin()->first);
                    }
                    else {
                        mp.rbegin()->second --;
                    }
                }
            }
        }
        if(mp.empty()) cout << "EMPTY\n";
        else cout << mp.rbegin()->first << ' ' << mp.begin()->first << '\n';
    }

    return 0;
}

import sys
import heapq
from collections import defaultdict

def input():
    return sys.stdin.readline().rstrip()

for T in range(int(input())):
    max_q = []
    min_q = []
    total_ele_cnt = 0
    elements_cnt = defaultdict(int)
    for _ in range(int(input())):
        operator, number = input().split()
        if operator == 'I':
            number = int(number)
            heapq.heappush(max_q, -number)
            heapq.heappush(min_q, number)
            elements_cnt[number] += 1
            total_ele_cnt += 1
        else:
            if total_ele_cnt > 0:
                if number == '1':
                    while True:
                        del_num = -heapq.heappop(max_q)
                        if elements_cnt[del_num] != 0:
                            elements_cnt[del_num] -= 1
                            break
                else:
                    while True:
                        del_num = heapq.heappop(min_q)
                        if elements_cnt[del_num] != 0:
                            elements_cnt[del_num] -= 1
                            break
                total_ele_cnt -= 1
    if total_ele_cnt:
        while True:
            max_v = -heapq.heappop(max_q)
            if elements_cnt[max_v] != 0:
                break
        while True:
            min_v = heapq.heappop(min_q)
            if elements_cnt[min_v] != 0:
                break
        print(max_v, min_v)
    else:
        print('EMPTY')