99클럽 TIL (240828)

> [Middler] https://school.programmers.co.kr/learn/courses/30/lessons/142085

 

 

문제 해결

python

import heapq
def solution(n, k, enemy):
    skill = [0] * k # 무적권
    for i in range(len(enemy)) :
        if enemy[i] > skill[0] :
            mn = heapq.heappop(skill)
            heapq.heappush(skill, enemy[i])
            n -= mn
        else :
            n -= enemy[i]
        if n < 0 :
            return i
    return len(enemy)