프로그래머스 더 맵게

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

코딩테스트 연습 - 더 맵게

 

import heapq

def solution(scoville, K):
    answer = 0
    heapq.heapify(scoville)
    
    while len(scoville) > 1 and scoville[0] < K:
        tmp = heapq.heappop(scoville)
        tmp2 = heapq.heappop(scoville)
        tmp3 = tmp + (tmp2 * 2)
        heapq.heappush(scoville, tmp3)
        answer += 1

    for x in scoville:
        if x < K:
            return -1
    
    return answer