Uva-10130 SuperSale 01背包

题目大意：m次01背包和

#include <stdio.h>
#include <string.h>
#include<functional>
#include <queue>
#include <algorithm>
using namespace std;
const int maxn = 1005;
const int inf = 1<<30;
int n,m;
int val[maxn],w[maxn];
int dp[maxn];
int ZeroOnePacc( int v )
{
	memset( dp,0,sizeof(dp) );
	for( int i = 1; i <= n; i ++ ){
		for( int j = v; j >= w[i]; j -- ){
			dp[j] = max( dp[j],dp[j-w[i]] + val[i] );
		}
	}
	return dp[v];
}
int main()
{
	#ifndef ONLINE_JUDGE  
    freopen("data.txt","r",stdin);  
    #endif  
	int cas,v;
	scanf("%d",&cas);
	while( cas -- )
	{
		scanf("%d",&n);
		for( int i = 1; i <= n; i ++  )
			scanf("%d%d",&val[i],&w[i]);
		int ans = 0;
		scanf("%d",&m);
		for( int i = 0; i < m; i ++ ){
			scanf("%d",&v);
			ans += ZeroOnePacc(v);
		}
		printf("%d\n",ans);
	}
    return 0;
}