[BaekJoon 7662 : Data Structure, Python] - 이중 우선순위 큐

import sys
from heapq import *
from collections import defaultdict
input = sys.stdin.readline

def dualheapq(n):
    maxh = []
    minh = []
    out = defaultdict(int)

    i = 1
    cnt = 0
    for i in range(n):
        order, value = input().split()
        value = int(value)

        if order == 'I':
            heappush(maxh, [-value, i])
            heappush(minh, [value, i])
            out[i] = 0
            cnt += 1
            i += 1

        elif order == 'D' and cnt > 0:
            if value == 1:
                while out[maxh[0][1]]:
                    heappop(maxh)
                _, idx = heappop(maxh)
                out[idx] = 1

            elif value == -1:
                while out[minh[0][1]]:
                    heappop(minh)
                _, idx = heappop(minh)
                out[idx] = 1
            cnt -= 1
    
    if cnt > 0:
        while out[maxh[0][1]]:
            heappop(maxh)
        while out[minh[0][1]]:
            heappop(minh)
        mx, mn = -maxh[0][0], minh[0][0]
        print(f"{mx} {mn}")
    else:
        print("EMPTY")


tc = int(input())
while tc:
    n = int(input())
    dualheapq(n)
    tc -= 1