北大oj--3624

最新推荐文章于 2020-04-01 10:35:32 发布

TwinklingZ

最新推荐文章于 2020-04-01 10:35:32 发布

阅读量532

点赞数

分类专栏： ACM 文章标签： ACM

本文链接：https://blog.csdn.net/u012899005/article/details/38425069

版权

ACM 专栏收录该内容

34 篇文章 0 订阅

订阅专栏

/*
Charm Bracelet
Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 23255		Accepted: 10507
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 Wi (1 ≤ Wi ≤ 400), a 'desirability' factor Di (1 ≤ Di ≤ 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: Wi and Di

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

01背包问题 
关键代码：
if(j>=w[i]){
	mv[j]=Max(mv[j],mv[j-w[i]]+v[i]);
} 
*/ 

#include <stdio.h>
#include <string.h>

#define Max(a,b) ((a)>(b)?(a):(b))   //宏定义，取最大
#define N 3410
#define M 12890
int w[N],v[N],mv[M];

int main(){
	int r,c;
	int i,j;
	while(scanf("%d%d",&r,&c)==2){
		memset(w,0,sizeof(w));
		memset(v,0,sizeof(v));
		memset(mv,0,sizeof(mv));
		for(i=1;i<=r;i++){
			scanf("%d%d",&w[i],&v[i]);
		}
		for(i=1;i<=r;i++){
			for(j=c;j>=0;j--){
				if(j>=w[i]){
					mv[j]=Max(mv[j],mv[j-w[i]]+v[i]);
				}
			}
		}
		for(i=0;i<=c;i++)
		printf("%d\n",mv[i]);
	} 
	return 0;
}