hdu 1171 Big Event in HDU（0-1背包问题）

Big Event in HDU

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

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

 

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 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

 

解题思路：寻找不超过总价值一半的最大价值的物品，结合背包问题递推公式。

#include 
#include 
#include 
using namespace std;

int f[126005];
int v[55],m[105];
int main()
{
    //freopen("test.txt","r",stdin);
    int n;
    //int m,v;
    int i,j,k;
    while(cin>>n && n>=0)
    {

        int sum = 0;
        memset(f,0,sizeof(f));
        for(i=0;i>v[i]>>m[i];
            sum += v[i]*m[i];
        }
        int half = sum/2;
        for(i=0;i=v[i];k-=v[i])
                {
                    f[k] = max(f[k],f[k-v[i]]+v[i]);
                }
            }
        }
        if(f[half]