完全背包问题

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int n, W, w[1000], v[1000];
int dp[1000][1000];
void solve()
{
for (int i = 0; i < n; i++){
for (int j = 0; j <= W; j++){
if (j < w[i]){
dp[i + 1][j] = dp[i][j];
}
else{
dp[i + 1][j] = max(dp[i][j], dp[i + 1][j - w[i]] + v[i]);
}
}
}
printf("%d\n", dp
[W]);
}

int main()
{
while (scanf("%d%d", &n, &W) != EOF){
for (int i = 0; i < n; i++)
scanf("%d%d", &w[i], &v[i]);
solve();
}
return 0;
}