import sys import heapq T = int(sys.stdin.readline()) result = [] for i in range(T): max_arr = [] min_arr = [] visit = [False] * 1_000_001 K = int(sys.stdin.readline()) count = 0 for i in range(K): S, num = sys.stdin.readline().split() if S == "I": # 튜플의 첫번째로 인해 우선순위 바뀜 heapq.heappush(max_arr, (-int(num), i)) heapq.heappush(min_arr, (int(num), i)) # True == 아직 지워지지 않음 visit[i] = True else: if in..