2014/9/15
多重背包我不会~
好奇怪 while(~scanf("%d",&n)&&n != -1) wa了, while(~scanf("%d",&n)&&n>= 0)就能AC。。
也是给HDU 的数据跪了(题目说的是以-1结束呀,我理解错了?= = )
转战实验室继续撸dp(看博客)
//阳光刺痛双眸
#include<stdio.h>
#include<string.h>
#include<cmath>
#include<algorithm>
#include<iostream>
#include<queue>
#include<stack>
#include<map>
#include<climits>
#include<vector>
using namespace std;
typedef long long ll;
#define f(x,y,i) for(int i = x;i < y; i++)
#define ff(x,y,i) for(int i = x;i <= y; i++)
#define F(x,y,i) for(int i = x; i >= y; i--)
#define FF(x,y,i) for(int i = x; i > y; i++)
#define lson pos<<1,l,mid
#define rson pos<<1|1,mid+1,r
#define Min(x,y) x<y?x:y
#define Max(x,y) x>y?x:y
#define sc(n) scanf("%d",&n)
#define pr(n) printf("%d\n",n)
#define met(n,m) memset(n, m, sizeof(n))
#define mod 10007
const int N=255000;
int n , m , d,cnt , sum , minn,maxn ;
int c[100];
int v[100];
int dp[N];
int main()
{
int tmp = 0;
while(~scanf("%d",&n)&&n>= 0)
{
sum =0;
met(dp,0);
f(0,n,i)
{
scanf("%d%d",&v[i],&c[i]);
sum+=v[i]*c[i];
}
f(0,n,i)
{
for(int j = sum/2;j>= v[i]; j--)
{
for(int k = 0;k <= c[i]&&k*v[i]<= j; k++)
{
dp[j]=Max(dp[j],dp[j-k*v[i]]+k*v[i]);
}
}
}
printf("%d %d\n",sum-dp[sum/2],dp[sum/2]);
}
return 0;
}