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
这也是背包问题 只不过有些特别的是w重量的限制不再是一个,而是对个,对于这样的处理时先找出来w这个数组中最大的质量,然后利用背包将其按最大质量求解,然后就是遍历一下累计结果,即:
int maxv=0;
for(i=0;i<g;i++){
maxv+=dp[G[i]];
}
/*
Name: SuperSale
Copyright:
Author:
Date: 01/08/14 16:28
Description: 背包问题
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
struct Node{
int p,w;
};
Node object[1005];
int G[105];
int dp[3005];
int maxw;
int g,n;
void solve(){
int i,j;
memset(dp,0,sizeof(dp));
for(i=0;i<n;i++){
for(j=maxw;j>=object[i].w;j--){
dp[j]=max(dp[j],dp[j-object[i].w]+object[i].p);
}
}
int maxv=0;
for(i=0;i<g;i++){
maxv+=dp[G[i]];
}
printf("%d\n",maxv);
return ;
}
int main(){
int t,k;
int i,j;
scanf("%d",&t);
while(t--){
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %d",&object[i].p,&object[i].w);
}
scanf("%d",&g);
maxw=0;
for(i=0;i<g;i++){
scanf("%d",&G[i]);
if(maxw<G[i])maxw=G[i];
}
solve();
}
return 0;
}