hdu1171-01背包

Big Event in HDU

Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 34637 Accepted Submission(s): 12013

Problem Description
Nowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don’t know that Computer College had ever been split into Computer College and Software College in 2002.
The splitting is absolutely a big event in HDU! At the same time, it is a trouble thing too. All facilities must go halves. First, all facilities are assessed, and two facilities are thought to be same if they have the same value. It is assumed that there is N (0

/*
01背包
*/
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int val[5005];
int dp[250050];
int main(){
    int n,v,m,a,b,l,sum,i,j;
    //freopen("in.txt","r",stdin);
    while(scanf("%d",&n)!=EOF&&n>0){
        memset(dp,0,sizeof(dp));
        l=0;
        sum=0;
        for ( i = 0; i < n; ++i)
        {
            scanf("%d%d",&a,&b);
            while(b--){
                val[l++]=a;
                sum+=a;
            }           
        }
        for ( i = 0; i < l; ++i)
        {
            for ( j = sum/2; j >=val[i] ; j--)//01背包
            {
                dp[j]=max(dp[j],dp[j-val[i]]+val[i]);
            }
        }
        printf("%d %d\n", sum-dp[sum/2],dp[sum/2]);


    }

    return 0;
}