Uva 10130-SuperSale（0-1背包）

来源：互联网发布：周杨青的淘宝店铺编辑：程序博客网时间：2024/05/18 03:59

题目链接：点击打开链接

裸的0-1背包。。只不过相当于有多个背包，因为这些背包互相独立，求和相加就ok

#include <algorithm>#include <iostream>#include <cstring>#include <cstdlib>#include <string>#include <cctype>#include <vector>#include <cstdio>#include <cmath>#include <queue>#include <stack>#include <map>#include <set>#define maxn 1005#define _ll __int64#define ll long long#define INF 0x3f3f3f3f#define Mod 1<<40+10#define pp pair<int,int>#define ull unsigned long longusing namespace std;int n,v[maxn],w[maxn],m,G;int cal(int V){int dp[35];memset(dp,0,sizeof(dp));for(int i=1;i<=n;i++)for(int j=V;j>=v[i];j--)dp[j]=max(dp[j],dp[j-v[i]]+w[i]);return dp[V];}int main(){int T;scanf("%d",&T);while(T--){scanf("%d",&n);for(int i=1;i<=n;i++)scanf("%d%d",&w[i],&v[i]);int s=0;scanf("%d",&m);for(int i=0;i<m;i++){scanf("%d",&G);s+=cal(G);}printf("%d\n",s);}return 0;}

1 0