UVa 10130 SuperSale(DP_01背包)
来源:互联网 发布:淘宝企业店和旗舰店 编辑:程序博客网 时间:2024/06/16 01:56
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 Specification
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) it’s 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 Specification
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
Output for the Sample Input
72
514
每个人每个商品只能拿一件 要拿价值尽量高的商品 很简单的01背包题目 求出每个人可以拿的最大值 加起来就是结果了
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;#define maxn 1005int p[maxn],w[maxn],d[maxn],pe,t,n,g;int main(){ scanf("%d",&t); while (t--) { scanf("%d",&n); for(int i=1;i<=n;++i) scanf("%d%d",&p[i],&w[i]); scanf("%d",&g); int ans=0; for(int k=1;k<=g;++k) { memset(d,0,sizeof(d)); scanf("%d",&pe); for(int i=1;i<=n;++i) { for(int j=pe;j>=w[i];j--) d[j]=max(d[j],d[j-w[i]]+p[i]); } ans+=d[pe]; } printf("%d\n",ans); } return 0;}
- UVa 10130 SuperSale(DP_01背包)
- UVa 10130 - SuperSale 背包
- Uva-10130 SuperSale 01背包
- SuperSale - UVa 10130 01背包
- 【UVA】10130-SuperSale(01背包)
- UVA 10130 SuperSale(01背包)
- UVA 10130 SuperSale(背包)
- UVA 10130 SuperSale(dp + 01背包)
- uva 10130 SuperSale(01背包)
- UVa 10130 SuperSale (0-1背包)
- UVA 10130 SuperSale 0-1背包
- UVa 10130 SuperSale(DP 01背包)
- UVA - 10130 SuperSale 01背包问题
- UVA - 10130 SuperSale (01背包)
- Uva 10130-SuperSale(0-1背包)
- uva 10130 SuperSale (01背包)
- UVA 10130 SuperSale (DP 01背包)
- uva 10130 - SuperSale(01背包)
- 关于VLAN
- 数据库
- wincap网络数据包的捕获
- 私有保护方式
- Java 23种设计模式
- UVa 10130 SuperSale(DP_01背包)
- C++: quick sort(快排序)
- Win7下面wubi安装Ubuntu14.04LTS
- SpringMVC+Spring3+hibernate4 开发环境搭建以及一个开发实例教程
- 职场生存术
- 一个河北小城的大学毕业季
- Hooks——钩子概览
- 2429: [HAOI2006]聪明的猴子 (生成树)
- poj2728 Desert King --- 01分数规划 二分水果。。