POJ-3624(0-1 背包) Charm Bracelet

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int v[3450], w[3450];
int dp[3450];
int main(){
int i, j, N, W;
while (scanf("%d %d", &N,&W)!=EOF){
for (i = 1; i <= N; i++){
scanf("%d%d", &w[i],&v[i]);
}
memset(dp, 0, sizeof(dp));//每次重制数组dp
for (j = 1; j <= N; j++){
for (i = W; i >= w[j]; i--){
dp[i] = max(dp[i], dp[i - w[j]] + v[j]);
}
}
cout<<dp[W]<<endl;
}
return 0;
}