[프로그래머스] 코딩테스트 연습 > 힙(Heap) > 더 맵게

 

 

import heapq

def solution(scoville, K):
    answer = 0
    heapq.heapify(scoville)
    
    while True:
        num1 = heapq.heappop(scoville)
        if num1 >= K : break
        
        if len(scoville) == 0: return -1
        num2 = heapq.heappop(scoville)
        num = num1 + num2*2
        heapq.heappush(scoville, num)
        answer += 1
         
    
    return answer