HDU - 2602 Bone Collector

Sample Input
1
5 10
1 2 3 4 5
5 4 3 2 1

Sample Output
14

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <algorithm>
 5 #include <cmath>
 6 #include <stack>
 7 #include <map>
 8 #include <vector>
 9 using namespace std;
10 
11 #define N 2500
12 #define INF 0x3f3f3f3f
13 
14 int p[N],v[N],dp[25000];
15 
16 int main()
17 {
18     int T,n,m,i,j;
19 
20     scanf("%d", &T);
21 
22     while(T--)
23     {
24         memset(dp,0,sizeof(dp));
25 
26         scanf("%d %d",&n, &m);
27 
28         for(i=1;i<=n;i++)
29             scanf("%d", &p[i]);
30         for(i=1;i<=n;i++)
31             scanf("%d", &v[i]);
32 
33         for(i=1;i<=n;i++)
34             for(j=m;j>=v[i];j--)
35             dp[j]=max(dp[j],dp[j-v[i]]+p[i]);
36 
37         printf("%d\n", dp[m]);
38     }
39     return 0;
40 }