hdu 2602 dp

2014/9/12

   最爱水题

#include<stdio.h>
#include<string.h>
#include<cmath> 
#include<algorithm>
#include<iostream>
#include<queue>
#include<stack>
#include<map>
#include<climits>
#include<vector>
using namespace std;
typedef long long ll;  
#define f(x,y,i) for(int i = x;i < y; i++)
#define ff(x,y,i) for(int i = x;i  <= y; i++)
#define F(x,y,i) for(int i = x; i >= y; i--)
#define FF(x,y,i) for(int i = x; i > y; i++)
#define lson pos<<1,l,mid
#define rson pos<<1|1,mid+1,r
#define Min(x,y) x<y?x:y
#define Max(x,y) x>y?x:y
#define sc(n) scanf("%d",&n)
#define pr(n) printf("%d\n",n)
#define met(n,m) memset(n, m, sizeof(n)) 
#define mod 10007
const int N=1050;
int n , tot ,m , k;

int w[N],v[N];   
int dp[N];
int maxn;

int main()
{
   scanf("%d",&tot);
   while(tot--)
   {
   	met(dp,0);
   	scanf("%d%d",&n,&m);
   	f(0,n,i)scanf("%d",&v[i]);
    f(0,n,i)scanf("%d",&w[i]);
 
    
    f(0,n,i)
    {
    	for(int j = m;j >= w[i]; j--)
    	{
	    	dp[j]=Max(dp[j],dp[j-w[i]]+v[i]);
	    }
    }
	
	printf("%d\n",dp[m]);
    
   }
        
    return 0;
}