나의 코드

from itertools import permutations

def check(k, dungeon):
    count = 0
    for i in dungeon:
        if k >= i[0]:
            k -= i[1]
            count += 1
    return count

def solution(k, dungeons):
    answer = 0

    for i in permutations(dungeons, len(dungeons)):
        cur = 0
        if check(k, i):
            cur = check(k, i)
        answer = max(answer, cur)

    return answer

 

내 피로도는 0....

+ Recent posts