힙 - 더 맵게 / 파이썬

import heapq

def solution(scoville, K):
    answer = 0
    heapq.heapify(scoville)
    while True:
        if len(scoville) == 1 and scoville[0] < K:
            return -1
        min1 = heapq.heappop(scoville)
        min2 = heapq.heappop(scoville)
        heapq.heappush(scoville, min1+(min2*2))
        answer += 1
        if scoville[0] >= K:
            break
    return answer

 

 

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

코딩테스트 연습 - 더 맵게