hdu 1171-Big Event in HDU

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1171

 

题目描述：

 

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<N<1000) kinds of facilities (different value, different kinds). 

Input

Input contains multiple test cases. Each test case starts with a number N (0 < N <= 50 -- the total number of different facilities). The next N lines contain an integer V (0<V<=50 --value of facility) and an integer M (0<M<=100 --corresponding number of the facilities) each. You can assume that all V are different. 
A test case starting with a negative integer terminates input and this test case is not to be processed. 

Output

For each case, print one line containing two integers A and B which denote the value of Computer College and Software College will get respectively. A and B should be as equal as possible. At the same time, you should guarantee that A is not less than B. 

Sample Input

2
10 1
20 1
3
10 1 
20 2
30 1
-1

Sample Output

20 10
40 40

 

 

 

题目大意：

给出n种物品，然后每行输出一种物品的价值和数目，现在教你想办法把这些物品分成尽可能相等的两部分，并输出两部分各自的值（大的在前，小的在后）

 

题目分析：

既然是要求我们尽可能分成两部分，那么我们可以把背包的容量就设成总价值的一半，然后在这个背包里面尽可能多的放入物品，求最大价值（先转换成01背包来做）

 

AC代码：

 

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstdlib>
using namespace std;
int v[1000005],dp[1000005];
int n,a,b,cnt,sum;

int main()
{
    while(1)
    {
        cin>>n;
        if(n<0)
            break;
        sum=0;
        cnt=1;
        while(n--)
        {
            cin>>a>>b;
            while(b--)
            {
                v[cnt++]=a;
                sum+=a;
            }
        }
        memset(dp,0,sizeof(dp));
        for(int i=1;i<cnt;i++)
        {
            for(int j=sum/2;j>=v[i];j--)
                {
                    dp[j]=max(dp[j],dp[j-v[i]]+v[i]);
                }
        }
        cout<<sum-dp[sum/2]<<" "<<dp[sum/2]<<endl;
    }
    return 0;
}