Bone Collector 01背包问题

题目描述

 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 ?

 

输入

 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.

输出

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

 

示例输入

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

示例输出

14

第一次做背包问题，研究的别人的代码

这张图片就可说明问题

#include<stdio.h>
#include<string.h>
int main()
{
    int t,n,v,f[1001],vol[1001],val[1001],sum;
    scanf("%d",&t);
    for(int i=1;i<=t;i++)
    {
        scanf("%d %d",&n,&v);
        for(int i=0;i<n;i++)
        scanf("%d",&vol[i]);
        for(int i=0;i<n;i++)
        scanf("%d",&val[i]);
        memset(f,0,sizeof(f));
        for(int i=0;i<n;i++)
        {
            for(int j=v;j>=vol[i];j--)
            {
                sum=f[j-vol[i]]+val[i];
                if(f[j]<sum)
                f[j]=sum;
            }
        }printf("%d
",f[v]);
    }return 0;
}