poj 3624 Charm Bracelet(01背包)

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
int dp[13000],w[4000],v[4000];
void BeiBao(int n,int m){
int i,j;
for(i=0;i<n;i++){
for(j=m;j>=w[i];j--){
dp[j]=max(dp[j],dp[j-w[i]]+v[i]);
}
}
}
int main(){
int n,m,i,j;
memset(dp,0,sizeof(dp));
memset(w,0,sizeof(w));
memset(v,0,sizeof(v));
scanf("%d%d",&n,&m);
for(i=0;i<n;i++){
scanf("%d%d",&w[i],&v[i]);
}
BeiBao(n,m);
printf("%d\n",dp[m]);
return 0;

}