피로도 - [파이썬]

from itertools import permutations as p
def solution(k, dungeons):
    m = 0
    l = len(dungeons)
    for a in p(range(l)):
        b = k
        for n, i in enumerate(a):
            if b < dungeons[i][0]:
                m = max(m, n)
                break
            b -= dungeons[i][1]
        else:
            return l
    return m

k = 80
dungeons = [[80,20],[50,40],[30,10]]
print(solution(k, dungeons))