01背包模板-HDU 2602 Bone Collector-dp练习赛

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 ?

InputThe 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.OutputOne 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

#include<iostream>
#define ll long long
using namespace std;
ll f[1005];
ll V[1005],W[1005];
ll n,t;
int max(int a,int b){
    if(a>b) return a;
    else return b;
}
int main(){
    int T;cin>>T;
    while(T--){
    memset(V,0,sizeof(V));
    memset(W,0,sizeof(W));
    memset(f,0,sizeof(f));
    cin>>n>>t;
    for(ll i=1;i<=n;i++){
        cin>>V[i];
    }
    for(ll i=1;i<=n;i++){
        cin>>W[i];
    }
    for(ll i=1;i<=n;i++){
        for(ll j=t;j>=0;j--){
            if(j-W[i]>=0)
                f[j]=max(f[j],f[j-W[i]]+V[i]);
            else f[j]=f[j];
        }
    }
    cout<<f[t]<<endl;
    }
    return 0;
}