求助第四题

[韦锦鹏]

start=int(input())
L=[int(x) for x in input().split()]
def main(L, start):
    curr = 0
    enemy = 0
    best = 0
    L.sort(reverse=True)
    for i in range(len(L)):
        mon = start + sum(L[:i+1])
        enemy += 1
        curr = 0
        for j in range(len(L)-1, i, -1):
            if mon >= L[j]:
                curr += 1
                mon -= L[j]
            else:
                break
        if best < curr - enemy:
            best = curr - enemy
        else:
            return best
    return best
print(main(L,start))