HDU

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

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2602

********************************************

分析：背包模型

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <stack>
#include <map>
#include <vector>
using namespace std;

#define N 2500
#define INF 0x3f3f3f3f

int p[N],v[N],dp[25000];

int main()
{
    int T,n,m,i,j;

    scanf("%d", &T);

    while(T--)
    {
        memset(dp,0,sizeof(dp));

        scanf("%d %d",&n, &m);

        for(i=1;i<=n;i++)
            scanf("%d", &p[i]);
        for(i=1;i<=n;i++)
            scanf("%d", &v[i]);

        for(i=1;i<=n;i++)
            for(j=m;j>=v[i];j--)
            dp[j]=max(dp[j],dp[j-v[i]]+p[i]);

        printf("%d
", dp[m]);
    }
    return 0;
}