题解 | #装箱问题#

01背包问题且不用把背包装满，物品价值即为自身体积

v = int(input())
n = int(input())
a = []
for i in range(n):
    a.append(int(input()))
dp = [0] * (v + 1)
for i in range(n):
    for j in range(v, a[i]-1, -1):
        dp[j] = max(dp[j], dp[j-a[i]] + a[i])
print(v - dp[-1])