import heapq
def solution(scoville, K):
answer = 0
heapq.heapify(scoville)
while(True):
if heapq.heappop(scoville) < K:
answer += 1
tmp1 = heapq.heappop(scoville)
tmp2 = heapq.heappop(scoville)
heapq.heappush(scoville, tmp1 + tmp2 * 2)
else:
break
return answer + 1