英文题面翻译18

英文原题：题目来源：https://acs.jxnu.edu.cn/problem/HDU1171

Big Event in HDU

 5000ms  32768K

描述：

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

输出：

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.

翻译：

发生在HDU中的大事件

描述：

现在，大家都知道计算机学院是HDU最大的学院。但是，可能你不知道计算机学院曾在2002年被分为计算机学院和软件学院。
拆分绝对是HDU的一件大事！同时，这也是一件麻烦事。所有设施必须分成两半。首先，对所有设施进行评估，如果两个设施的价值相同，则认为它们是相同的。假设有N种设施(0<N<1000)（种类不同价值不同）

输入：

输入包含多个测试用例。每个测试用例以一个数字N开始，输入为空时停止输入。

输出： 

对于每种情况，输出一行，其中包含两个整数A和B，分别表示计算机学院和软件学院能够获得的价值。A和B应该尽可能相等。同时，你应该保证A不小于B。