背包一

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 2 31).

Sample Input

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

Sample Output

14

题意就是给了t组数据，然后每组3行，

第一行第一个数代表有n件物品，第二个数代表背包体积

第二行代表每件物品的价值v[i]

第三行代表每件物品的体积w[i]

背包问题

Select Code

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int v[1010],w[1010],f[1010];
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n,c,i,j;
        scanf("%d%d",&n,&c);
        memset(v,0,sizeof(v));
        memset(w,0,sizeof(w));
        memset(f,0,sizeof(f));
        for(i=1;i<=n;i++)
            scanf("%d",&v[i]);
        for(i=1;i<=n;i++)
            scanf("%d",&w[i]);
        for(i=1;i<=n;i++)
        {
            for(j=c;j>=w[i];j--)
            {
                f[j]=max(f[j],f[j-w[i]]+v[i]);
            }
        }
        printf("%d\n",f[c]);
    }
    return 0;
}