大佬可以帮我看看逻辑有什么问题嘛（dp）

#include<bits/stdc++.h>
using namespace std;
int a[35], dp[35][20005];
int main()
{
	int v, n;
	cin >> v >> n;
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= v; j++) {
			if (i == 1) {
				if (a[i] < j) dp[i][j] = j - a[i];
				else dp[i][j] = j;
			}
			else {
				if (a[i] < j) dp[i][j] = min(dp[i - 1][j], dp[i - 1][j - a[i]]);
				else dp[i][j] = dp[i - 1][j];
			}
		}
	}cout << dp[n][v];
	return 0;
}