###### 1019 Problem S
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.<br>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&lt;N&lt;1000) kinds of facilities (different value, different kinds).<br>

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.<br>A test case starting with a negative integer terminates input and this test case is not to be processed.<br>

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

Sample Input
2 10 1 20 1 3 10 1 20 2 30 1 -1

#include<iostream>
using namespace std;
int max(int a,int b)
{
if(a > b)
return a;
else
return b;
}
int main()
{
int f[200047],val[200047];
int t,n,i,j,k,l,sum,x,y;
while(cin>>n&&n>0){
memset(val,0,200047);
memset(f,0,200047);
sum = 0;
l = 0;
for(i = 0 ; i < n ; i++)
{
cin>>x>>y;
for(int p=0 ; p<y ; p++)
{
val[l++] = x;
sum+=x;
}
}
for(i = 0 ; i < l ; i++)//01背包
{
for(j = sum/2 ; j >= val[i]; j--)
{
f[j] = max(f[j],f[j-val[i]]+val[i]);
}
}
cout<<sum-f[sum/2]<<" "<<f[sum/2]<<endl;
}
return 0;
}

#### 【NOIP2015】day1第一题：生活大爆炸版 石头剪刀布

2015-03-22 10:37:52

#### PAT 1019数字黑洞

2016-05-23 20:17:00

#### 51nod - 1019 逆序数（归并排序or线段树）

2016-07-28 09:52:27

#### PAT（乙级）1019. 数字黑洞

2016-06-27 19:26:37

#### 51nod 1019 逆序数

2015-12-08 21:47:06

#### Codeforces-954F：Runner's Problem（矩阵快速幂+离散化）

2018-03-25 22:15:19

#### 杭电acm 1019 Least Common Multiple

2015-05-30 17:57:19

#### POJ - 3320 Jessica's Reading Problem（尺取法）

2015-09-29 16:24:43

#### 【模拟】【HDU1443】 Joseph

2014-10-01 20:10:35

#### PAT甲级1019

2017-01-09 19:09:20

1019 Problem S