42626번: 더 맵게 (힙)

programmers.co.kr/learn/courses/30/lessons/42626

코딩테스트 연습 - 더 맵게

import heapq


def solution(scoville, K):
    queue = []
    [heapq.heappush(queue, x) for x in scoville]

    cnt = 0
    while True:
        f = heapq.heappop(queue)
        s = heapq.heappop(queue)
        heapq.heappush(queue, f + (s * 2))
        cnt += 1

        if all(x > K for x in queue):
            break
        if len(queue) == 1:
            return -1

    return cnt


res = solution([1, 2, 3, 9, 10, 12], 7)
print(res)