Charm Bracelet poj 01 背包

Description

Bessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd like to fill it with the best charms possible from the N (1 ≤ N ≤ 3,402) available charms. Each charm i in the supplied list has a weight W_i (1 ≤ W_i ≤ 400), a 'desirability' factor D_i (1 ≤ D_i ≤ 100), and can be used at most once. Bessie can only support a charm bracelet whose weight is no more than M (1 ≤ M ≤ 12,880).

Given that weight limit as a constraint and a list of the charms with their weights and desirability rating, deduce the maximum possible sum of ratings.

Input

* Line 1: Two space-separated integers: N and M
* Lines 2..N+1: Line i+1 describes charm i with two space-separated integers: W_i and D_i

Output

* Line 1: A single integer that is the greatest sum of charm desirabilities that can be achieved given the weight constraints

Sample Input

4 6
1 4
2 6
3 12
2 7

Sample Output

23

#include<stdio.h>
#include<string.h>
#include<algorithm>
using std::max;
int a[5000],b[5000];
int dp[15000];    //dp记录该体积下能装的最大价值 
int main()
{
	int n,m;
	while(~scanf("%d%d",&n,&m))
	{
		for(int i=1;i<=n;i++)
			scanf("%d%d",&a[i],&b[i]);
			
		memset(dp,0,sizeof(dp));
		for(int i=1;i<=n;i++)
		  for(int j=m;j>=a[i];j--)
  			 if(dp[j-a[i]]+b[i]>dp[j])   //j体积背包的价值 和 装入第i个元素的情况下能装最大价值 比较 
  			    dp[j]=dp[j-a[i]]+b[i];   //如果装入第i个元素的时候价值更大，更新dp[j]
  		//dp[j]=max(dp[j-a[i]]+b[i],dp[j]);	      
  		//for(int i=1;i<=m;i++)	    
  		//printf(" %d\n",dp[i]);  
	
		printf("%d\n",dp[m]);
	}
	
}


#include<stdio.h>
#include<string.h>
#include<algorithm>
using std::max;
int a[5000],b[5000];
int dp[1500];
int main()
{
	int n,m;
	while(~scanf("%d%d",&n,&m))
	{
		for(int i=1;i<=n;i++)
		{
			scanf("%d%d",&a[i],&b[i]);
		}
		
        memset(dp,0,sizeof(dp));
		for(int i=1;i<=n;i++)
		   for(int j=a[i];j<=m;j++)          //这种情况一个charms可以使用多次 
		  {
			  dp[j]=max(dp[j],dp[j-a[i]]+b[i]);
			  //printf(" %d %d %d\n",i,j,dp[j]);
		  }
		
	 //for(int i=1;i<=m;i++)          
        //printf(" %d\n",dp[i]);  
		  
		printf("%d\n",dp[m]);
	}	
}