我不知道我的01背包有什么问题啊QaQ

#include "bits/stdc++.h"
using namespace std;
int m, n;
int v[110], w[110], dp[110][110]; 
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> m >> n;
	for (int i = 1; i <= n; i++)
		cin >> v[i] >> w[i];
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++){
			if (j < v[i]) dp[i][j] = dp[i - 1][j];
			else dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - v[i]] + w[i]);
		}
	cout << dp[n][m];
	return 0;
}