시간초과 관련

import sys


def DFS(L, subTotal):
    global maximum
    if subTotal > c:
        return
    if L == n:
        maximum = max(maximum, subTotal)
    else:
        DFS(L + 1, subTotal + a[L])
        DFS(L + 1, subTotal)

c, n = map(int, sys.stdin.readline().split())
a = []
for _ in range(n):
    a.append(int(sys.stdin.readline()))
maximum = 0
DFS(0, 0)
print(maximum)