Programmers - 더 맵게 [파이썬]

출처:

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

프로그래머스

 

import heapq

def solution(scoville, K):
    answer = 0
    heap = []
    for num in scoville:
        heapq.heappush(heap, num)
        
    while heap[0] < K:
        try:
            heapq.heappush(heap,heapq.heappop(heap) + (heapq.heappop(heap)*2))
        except IndexError:
            return -1
        answer += 1
    return answer