오답 n =int(input()) userSorted = [-10000,10000] for i in range(0,n): u = int(input()) #print(len(userSorted)) for j in range(0,len(userSorted)-1): if(userSorted[j]0 and -leftheap[0]>rightheap[0]): temp_left = -heapq.heappop(leftheap) temp_right = heapq.heappop(rightheap) heapq.heappush(leftheap,-temp_right) heapq.heappush(rightheap,temp_left) print(-leftheap[0])