POJ3624 Charm Bracelet

01背包，水过………………………………

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