UVA 10130 SuperSale 0-1背包

最裸的0-1背包，直接上代码

#include <map>
#include <set>
#include <list>
#include <cmath>
#include<cctype>
#include <ctime>
#include <deque>
#include <stack>
#include <queue>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define PI 3.1415926535897932626
using namespace std;
int gcd(int a, int b)
{
	return a % b == 0 ? b : gcd(b, a % b);
}
#define MAXN 1005
#define MAXD 33
int dp[MAXN],N,G;
int value[MAXN],weight[MAXN];
int mw;
struct tmp;
void read()
{
    scanf("%d",&N);
    for (int i=1;i<=N;i++)
        scanf("%d%d",&value[i],&weight[i]);
}
int calcu(int mw)
{
    memset(dp,0,sizeof(dp));
    for (int i=1;i<=N;i++)
    {
        for (int j=mw;j>=weight[i];j--)
            dp[j]=max(dp[j],dp[j-weight[i]]+value[i]);
    }
    return dp[mw];
}
void slove()
{
    int ans=0;
    scanf("%d",&G);
    for (int i=0;i<G;i++)
    {
        scanf("%d",&mw);
        ans+=calcu(mw);
    }
    printf("%d\n",ans);
}
int main()
{
    //freopen("sample.txt","r",stdin);
    int T;
    scanf("%d",&T);
    while (T--)
    {
        read();
        slove();
    }
    return 0;
}