[Python][프로그래머스][Level2] 더 맵게

import heapq
def solution(scoville, K):
    answer=0
    heapq.heapify(scoville)
    while scoville[0]<K:
        if len(scoville)<2:
            return -1
        spicy1=heapq.heappop(scoville)
        spicy2=heapq.heappop(scoville)
        heapq.heappush(scoville,spicy1+spicy2*2)
        answer+=1
    return answer