힙 / 더 맵게

import heapq

def solution(scoville, K):
    heapq.heapify(scoville)

    maxCount = len(scoville) - 1

    answer = 0
    curK = 0

    while maxCount > answer:
        first = heapq.heappop(scoville)
        second = heapq.heappop(scoville)
        heapq.heappush(scoville, first + (second * 2))
        answer += 1
        isAllOver = True
        for i in scoville:
            if i < K:
                isAllOver = False
                break

        if isAllOver:
            return answer

    return -1