UVA - 10130 - SuperSale (动态规划 - 01背包)

10130 SuperSale
There is a SuperSale in a SuperHiperMarket. Every person can take only one object of each kind, i.e.
one TV, one carrot, but for extra low price. We are going with a whole family to that SuperHiperMarket.
Every person can take as many objects, as he/she can carry out from the SuperSale. We have given list
of objects with prices and their weight. We also know, what is the maximum weight that every person
can stand. What is the maximal value of objects we can buy at SuperSale?
Input
The input consists of T test cases. The number of them (1 ≤ T ≤ 1000) is given on the first line of
the input file. Each test case begins with a line containing a single integer number N that indicates
the number of objects (1 ≤ N ≤ 1000). Then follows N lines, each containing two integers: P and W.
The first integer (1 ≤ P ≤ 100) corresponds to the price of object. The second integer (1 ≤ W ≤ 30)
corresponds to the weight of object. Next line contains one integer (1 ≤ G ≤ 100) its the number of
people in our group. Next G lines contains maximal weight (1 ≤ MW ≤ 30) that can stand this i-th
person from our family (1 ≤ i ≤ G).
Output
For every test case your program has to determine one integer. Print out the maximal value of goods
which we can buy with that family.
Sample Input
2
3
72 17
44 23
31 24
1
26
6
64 26
85 22
52 4
99 18
39 13
54 9
4
23
20
20
26
Sample Output
72
514





思路:就是01背包的变种啦,这里相当于有几个背包,我写的一维的,不知道二维的实现好不好


AC代码:

#include <cstdio>
#include <cstring>
#include <algorithm> 
using namespace std;

int p[1005], w[1005];
int dp[1005];

int main() {
	int T, n, m;
	scanf("%d", &T);
	while(T--) {
		scanf("%d", &n);
		for(int i = 0; i < n; i++) {
			scanf("%d%d", &p[i], &w[i]);
		}
		int ans = 0;
		scanf("%d", &m);
		while(m--) {
			int bag;
			scanf("%d", &bag);
			memset(dp, 0, sizeof(dp));
			for(int j = 0; j < n; j++) { 
				for(int i = bag; i >= w[j]; i--) {
					dp[i] = max(dp[i], dp[i-w[j]] + p[j]);
				}
			}
			//printf("%d\n", dp[bag]);
			ans += dp[bag];
		}
		printf("%d\n", ans);
	}
	return 0;
} 













  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值