SuperSale - UVa 10130 01背包
来源:互联网 发布:星星知多少迷你世界 编辑:程序博客网 时间:2024/06/15 23:20
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 Nlines, 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背包,把多个结果加起来。
AC代码如下:
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int dp[110],n,m;int main(){ int t,i,j,k,a,b,sum; scanf("%d",&t); while(t--) { scanf("%d",&n); memset(dp,0,sizeof(dp)); for(i=1;i<=n;i++) { scanf("%d%d",&a,&b); for(j=30;j>=b;j--) dp[j]=max(dp[j],dp[j-b]+a); } scanf("%d",&m); sum=0; for(i=1;i<=m;i++) { scanf("%d",&k); sum+=dp[k]; } printf("%d\n",sum); }}
- 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(DP 01背包)
- UVA - 10130 SuperSale 01背包问题
- UVA - 10130 SuperSale (01背包)
- uva 10130 SuperSale (01背包)
- UVA 10130 SuperSale (DP 01背包)
- uva 10130 - SuperSale(01背包)
- UVA.10130 SuperSale (DP 01背包)
- UVa 10130 SuperSale(DP_01背包)
- UVA 10130 SuperSale(背包)
- UVa 10130 SuperSale 01背包问题 入门题
- uva 10130 - SuperSale(01背包简单变换)
- 第七天-面向对象(继承,抽象类,接口)
- 一个只能在堆产生对象的类实现
- spring定时任务
- 关于数组类型的json解析方法
- JavaScript入门:004—JS注释的写法和基本运算符
- SuperSale - UVa 10130 01背包
- Android:Dialog和Activity的style的深入理解及对话框透明
- 【map<s,i>&getline】#STC 2 A. Indian Summer
- bzoj3407 [Usaco2009 Oct]Bessie's Weight Problem 贝茜的体重问题
- java中关于Integer.parseInt(),Integer.valueOf(),Ingeger.getInteger()方法的不同
- HttpURLConnection获取网络图片
- c语言实现动态指针数组Dynamic arrays
- struts2学习笔记一
- 一个数组是由一个递减数列左移若干位形成的,比如{4,3,2,1,6,5} 是由{6,5,4,3,2,1}左移两位形成的,在这种数组中查找某一个数