2602 Bone Collector dp-3

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 2³¹).

 

Sample Input

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

 

Sample Output

14

 不知道为什么老是WA，以后再来研究吧

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;

int main()
{
    int n,t,V,v[1005],w[1005],ans[1005];
    cin>>t;
    while(t--)
    {
        cin>>n>>V;
        for(int i=0;i<n;i++)
        cin>>v[i];
        for(int i=0;i<n;i++)
        cin>>w[i];
        memset(ans,0,sizeof(ans));
        for(int i=0;i<n;i++)
        {
            for(int j=V;j>=v[i];j--)
            if(ans[j]<ans[j-v[i]]+w[i])
            ans[j]=ans[j-v[i]]+w[i];
        }
        cout<<ans[V]<<endl;
    }
    return 0;
}

参考

http://www.cnblogs.com/yangcl/archive/2011/11/07/2240377.html