菜鸟dp写法，确定在v为i时的最小剩余并存入dp【

解题思路:

注意事项:

参考代码:

v = int(input())
n = int(input())
v_list = [int(input()) for _ in range(n)]
dp = [i + 1 for i in range(v)]

for i in range(v):
   for j in range(n):
       if dp[i] < v_list[j]:
           if i + 1 < v_list[j]:
               break
           else:
               dp[i] = min(dp[i - v_list[j]], dp[i])
       else:
           dp[i] = min(dp[i], dp[i] - v_list[j])
print(dp[v - 1])