import java.util.Scanner;
class Main {
public static void main(String[] args) {
int t;
Scanner scanner = new Scanner(System.in);
t = scanner.nextInt();
while(t > 0) {
t--;
int n = scanner.nextInt();
int[] p = new int[n+1];
int[] w = new int[n+1];
for(int i=1; i<=n; i++) {
p[i] = scanner.nextInt();
w[i] = scanner.nextInt();
}
int g = scanner.nextInt();
int[] gw = new int[g+1];
for(int i=1; i<=g; i++) {
gw[i] = scanner.nextInt();
}
int sum = 0;
for(int k=1; k<=g; k++) {
int[][] f = new int[n+1][gw[k]+1];
for(int i=1; i<=n; i++) {
for(int j=0; j<=gw[k]; j++) {
f[i][j] = (i == 1 ? 0 : f[i-1][j]);
if(j >= w[i]) {
f[i][j] = f[i-1][j-w[i]]+p[i] > f[i][j] ?
f[i-1][j-w[i]]+p[i] : f[i][j];
}
}
}
sum += f[n][gw[k]];
}
System.out.println(sum);
}
}
}
UVa 10130 - SuperSale
最新推荐文章于 2017-05-16 15:04:00 发布