[프로그래머스] 더 맵게 - python

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

프로그래머스

import heapq

def solution(scoville, K):
    answer = 0

    heapq.heapify(scoville)

    while scoville:
        if scoville[0] >= K:
            return answer
        if len(scoville) < 2:
            return -1
        first_min = heapq.heappop(scoville)
        sec_min = heapq.heappop(scoville)
        heapq.heappush(scoville, first_min + (sec_min*2))
        answer += 1