[파이썬]programmers: 더 맵게

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

프로그래머스

---

heap 문제

 

import heapq

def solution(scoville, K):
    answer = 0
    heapq.heapify(scoville)

    while scoville[0] <K:
        if len(scoville) > 1:
            answer +=1
            first = heapq.heappop(scoville)
            second = heapq.heappop(scoville)
            heapq.heappush(scoville, first + second*2)
        else:
            return -1
    return answer
solution([1, 2, 3, 9, 10, 12], 7)