[プログラマー]双優先級キュー(Python Python Python Python Python Python Python Python Python)

👉 にじゅうゆうせんれつ

マイコード

from collections import defaultdict
import heapq as hq


def solution(operations):
    max_h = []
    min_h = []
    dic = defaultdict(int)
    for i in operations:
        com, num = i.split(" ")
        if com == "I":
            hq.heappush(min_h, int(num))
            hq.heappush(max_h, -int(num))
            dic[int(num)] += 1

        else:
            while num == "-1" and min_h:
                n = hq.heappop(min_h)
                if dic[n] != 0:
                    dic[n] -= 1
                    break

            while num == "1" and max_h:
                n = hq.heappop(max_h)
                if dic[-n] != 0:
                    dic[-n] -= 1
                    break
    max = min = 0
    while min_h:
        n = hq.heappop(min_h)
        if dic[n] != 0:
            dic[n] -= 1
            min = n
            break

    while max_h:
        n = hq.heappop(max_h)
        if dic[-n] != 0:
            dic[-n] -= 1
            max = -n
            break

    return [max, min]

チップ