-
Notifications
You must be signed in to change notification settings - Fork 1
/
UVa 10130.cpp
67 lines (47 loc) · 1.17 KB
/
UVa 10130.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
#include <bits/stdc++.h>
using namespace std;
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) freopen(f, "w", stdout)
#define rep(i, n) for(int i = 0 ; i < (n) ; i++)
#define iter(i, a, b) for(int i = (a) ; i < (b) ; i++)
#define mem(a, b) memset(a, b, sizeof(a))
typedef long long ll;
typedef pair< int , int > pii;
typedef pair< int , pii > iii;
typedef vector< pii > vii;
#define INF 1000000000
#define pi (2.0 * acos(0.0))
#define MAXX 1000
#define MAX_N 1005
#define MAX_W 35
int dp[MAX_N][MAX_W];
int weight[MAX_N], val[MAX_N];
int n;
int knapSack(int idx, int remW){
if(idx == n || remW == 0)
return 0;
if(dp[idx][remW] != -1)
return dp[idx][remW];
if(weight[idx] > remW)
return dp[idx][remW] = knapSack(idx + 1, remW);
return dp[idx][remW] = max(knapSack(idx + 1, remW), val[idx] + knapSack(idx + 1, remW - weight[idx]));
}
int main(){
//READ("UVa 10130.txt");
int tc, case_no = 0;
scanf("%d", &tc);
while(tc--){
mem(dp, -1);
scanf("%d", &n);
rep(i, n)
scanf("%d %d", &val[i], &weight[i]);
int G, maxW, ans = 0;
scanf("%d", &G);
while(G--){
scanf("%d", &maxW);
ans += knapSack(0, maxW);
}
printf("%d\n", ans);
}
return 0;
}