东西有无限个,那就是赤裸裸的01背包了,没什么好说的,多几个人加一起就行了,第一次直接枚举0~50的背包状态。
13999279 | 10130 | SuperSale | Accepted | C++ | 0.039 | 2014-08-06 14:30:20 |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<map>
#include<stack>
#include<queue>
#include<set>
#include<ctime>
#include<cmath>
#include<string>
#include<iomanip>
#include<climits>
#include<cctype>
#include<deque>
#include<list>
#include<sstream>
#include<vector>
#include<cstdlib>
using namespace std;
#define _PI acos(-1.0)
#define INF (1 << 30)
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> pill;
/*================================================
================================================*/
#define MAXD 1000 + 10
int W[MAXD],P[MAXD];
int dp[MAXD][50];
int n;
void Input(){
scanf("%d",&n);
for(int i = 1 ; i <= n ;i++)
scanf("%d%d",&P[i],&W[i]);
memset(dp,0,sizeof(dp));
return ;
}
void DP(int C){
for(int i = 1 ; i <= n ;i++)
for(int j = 0 ; j <= C ; j++){
dp[i][j] = dp[i - 1][j];
if(j - W[i] >= 0)
dp[i][j] = max(dp[i][j],dp[i - 1][j - W[i]] + P[i]);
}
}
int main(){
int T;
scanf("%d",&T);
while(T--){
Input();
int ans = 0,m;
scanf("%d",&m);
DP(50);
for(int i = 0 ; i < m ; i++){
int C;
scanf("%d",&C);
ans += dp[n][C];
}
printf("%d\n",ans);
}
return 0;
}