#include <stdio.h>
#include <string.h>
#define M 14000
int dp[M];
int main()
{
	int n,m,v,w;
	memset(dp,0,sizeof(dp));
	scanf("%d %d",&n,&m);
	for(int i=1;i<=n;i++)
	{
		scanf("%d %d",&w,&v);
		for(int j=m;j>=w;j--)
		{
			int temp=dp[j-w]+v;
			if(temp>dp[j])
		 		dp[j]=temp;
		}	
	}
	printf("%d\n",dp[m]);
	return 1;
}

• Re:dp问题!附代码! (388) 20142430108 2016-06-06 12:27:09
• Re:dp问题!附代码! (388) 20142430136 2016-06-22 13:40:57
• Re:dp问题!附代码! (388) 040428 2019-06-27 10:01:05
  • 超时 (0) 040428 2019-06-27 10:01:45
• return 1;? (340) leadfox 2021-08-01 10:15:11