프로그래머스 - 디펜스 게임 (L2)

 1import heapq
 2
 3def solution(n, k, enemy):
 4    heap = []
 5    cnt = 0 
 6    for i in enemy:
 7        n -= i
 8        heapq.heappush(heap, -i)
 9        while n < 0:
10            k -= 1
11            if not heap or k < 0:
12                return cnt
13            tmp = -heapq.heappop(heap)
14            n += tmp
15        cnt += 1
16    return cnt