HDU 2660 Accepted Necklace

                                                             Accepted Necklace

             Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
                                         Total Submission(s): 3967    Accepted Submission(s): 1578

Problem Description

I have N precious stones, and plan to use K of them to make a necklace for my mother, but she won't accept a necklace which is too heavy. Given the value and the weight of each precious stone, please help me find out the most valuable necklace my mother will accept.

 

Input

The first line of input is the number of cases.
For each case, the first line contains two integers N (N <= 20), the total number of stones, and K (K <= N), the exact number of stones to make a necklace.
Then N lines follow, each containing two integers: a (a<=1000), representing the value of each precious stone, and b (b<=1000), its weight.
The last line of each case contains an integer W, the maximum weight my mother will accept, W <= 1000.

 

Output

For each case, output the highest possible value of the necklace.

 

Sample Input

  
  

   
   1 
2 1 
1 1 
1 1 
3 
  
  

 

Sample Output

  
  

   
   1 
  
  
  
  

   
   题目大意：
  
  
  
  

   
   给出物品个数以及最多运用的物品个数，之后是每个物品的价值和重量，现在需要求出满足条件的最大价值。
  
  
  
  

   
   解题思路：
  
  
  
  

   
   水题，二维背包模板敲上去既可以了，本人因为初始化问题错了两遍（这种错误是该打脸的）。
  
  
  
  

   
   代码：
  
  
  
  

   
   #include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int a[1010][1010];
int b[1010],v[1010];
int main()
{
	int m,n,t,i,j,k,w;
	scanf("%d",&t);
	while(t--)
	{
	   scanf("%d%d",&m,&n);
	   for(i=1;i<=m;i++)
	   {
	   	  scanf("%d%d",&b[i],&v[i]);
		} 
	    scanf("%d",&w);
	    memset(a,0,sizeof(a));
	    for(i=1;i<=m;i++)
	    {
	    	for(j=n;j>0;j--)
	    	{
	    		for(k=w;k>=v[i];k--)
	    		{
	    			a[j][k]=max(a[j][k],a[j-1][k-v[i]]+b[i]);
				}
			}
		}
		printf("%d\n",a[n][w]);
    }
    return 0;
}