Bone Collector

#题目描述
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.
#OUPUTT
One integer per line representing the maximum of the total value (this number will be less than 231).
#Sample Input
1
5 10
1 2 3 4 5
5 4 3 2 1
#Sample Output
14

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct node
{
	int c,w;
}arr[1010];
int dp[1010];
int max(int a,int b)
{
	return a>b?a:b;
}
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		memset(dp,0,sizeof(dp));
		int n,v,i,j;
		scanf("%d%d",&n,&v);
		for(i=1;i<=n;i++)
		scanf("%d",&arr[i].c);
		for(i=1;i<=n;i++)
		scanf("%d",&arr[i].w);
		for(i=1;i<=n;i++)
		{
			for(j=v;j>=arr[i].w;j--)
			dp[j]=max(dp[j],dp[j-arr[i].w]+arr[i].c);//01背包动态转移方程
		}
		printf("%d\n",dp[v]);
	}
return 0;
}