简单01背包 Charm Bracelet poj3624

题目连接 http://poj.org/problem?id=3624

#include <stdio.h>
#include <string.h>
int main()
{
    int n,i,j,w[3500],val[3500],v,f[20000];
    while(~scanf("%d %d",&n,&v))
    {

    for(i = 1;i <= n;i++)
    {
        scanf("%d %d",&w[i],&val[i]);
    }
    memset(f,0,sizeof(f));
    for(i = 1;i<= n;i++)
    for(j = v;j>=w[i];j--)
    if(f[j] < f[j-w[i]]+val[i])
    f[j] = f[j-w[i]]+val[i];

    printf("%d\n",f[v]);

    }
    return 0;
}