Bone Collector

Problem Description

Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grave …

The bone collector had a big bag with a volume of V ,and along his trip of collecting there are a lot of bones , obviously , different bone has different value and different volume, now given the each bone’s value along his trip , can you calculate out the maximum of the total value the bone collector can get ?

Input

The first line contain a integer T , the number of cases.

Followed by T cases , each case three lines , the first line contain two integer N , V, (N <= 1000 , V <= 1000 )representing the number of bones and the volume of his bag. And the second line contain N integers representing the value of each bone. The third line contain N integers representing the volume of each bone.

Output

One integer per line representing the maximum of the total value (this number will be less than 231).

Example Input

1
5 10
1 2 3 4 5
5 4 3 2 1

Example Output

14
题意大概：第一行输入测试数据的组数。 第二行输入骨头的个数和自己背包的体积。  第三行输入每个骨头的价值。  
第四行输入每个骨头的体积。  输出可以获得的最大价值。
此题为背包问题中的一种，一个物品只能拿一次，求最大获得价值。

#include<stdio.h>
#include<string.h>
int df[1000];

int max(int a,int b)
{
    return (a>b?a:b);
}

int main()
{
    int t,i,j,n,v;
    int p[1000],w[1000];
    scanf("%d",&t);
    while(t--)
    {
        memset(df,0,sizeof(df));
        scanf("%d%d",&n,&v);
        for(i=0;i<n;i++)
        {
            scanf("%d",&p[i]);
        }
        for(i=0;i<n;i++)
        {
            scanf("%d",&w[i]);
        }
        for(i=0;i<n;i++)
        {
            for(j=v;j>=w[i];j--)
            {
                df[j]=max(df[j-w[i]]+p[i],df[j]);
            }
        }
        printf("%d\n",df[v]);
    }
    return 0;
}