POJ 1384 Piggy-Bank (完全背包)

最新推荐文章于 2024-10-01 18:52:56 发布

tiutiu2011

最新推荐文章于 2024-10-01 18:52:56 发布

阅读量283

点赞数

分类专栏： ACM-ICPC 文章标签： POJ 1384 Piggy-Bank 完全背包动态规划

本文链接：https://blog.csdn.net/tiutiu2011/article/details/49097055

版权

ACM-ICPC 专栏收录该内容

154 篇文章 0 订阅

订阅专栏

#include <stdio.h>
#define INF ( (1 << 30) - 1 )
#define MAX_KINDS_COINS 500
#define MAX_WEIGHT 10000

int emptyWeight, filledWeight;
int weightLimit;
int kindsOfCoins;
int value[MAX_KINDS_COINS + 1];
int weight[MAX_KINDS_COINS + 1];
int minValue[MAX_WEIGHT + 1];

int main(){

	int testCases;
	scanf("%d", &testCases);
	while (testCases--){
		scanf("%d%d", &emptyWeight, &filledWeight);
		scanf("%d", &kindsOfCoins);
		int coin;
		for (coin = 1; coin <= kindsOfCoins; coin++)
			scanf("%d%d", &value[coin], &weight[coin]);

		weightLimit = filledWeight - emptyWeight;
		int i;
		for (i = 1; i <= weightLimit; i++)
			minValue[i] = INF;
		minValue[0] = 0;
	
		int preCoins, lowerWeight, totalWeight, tempValue;
		for (preCoins = 1; preCoins <= kindsOfCoins; preCoins++){
			lowerWeight = weight[preCoins];
			for (totalWeight = lowerWeight; totalWeight <= weightLimit; totalWeight++){
				tempValue = minValue[totalWeight - lowerWeight] + value[preCoins];
				if (tempValue < minValue[totalWeight])
					minValue[totalWeight] = tempValue;
			}	
		}
		
		if (minValue[weightLimit] == INF)
			printf("This is impossible.\n");
		else
			printf("The minimum amount of money in the piggy-bank is %d.\n", minValue[weightLimit]);  

	}

	return 0;
}