2.9英语翻译打卡

链接：Big Event in HDU | JXNUOJ​​​​​​

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

计算机学院是杭电嘴的的学院，但你可能不知道计算机学院被分成计算机学院和软件学院在2002年。分家是大事，所以，分设备是个难题。已知，每个设施已评估好价值。如果两件设备价值相等代表他们相同。假设有N种设备。

输入：

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.

输入多组测试数据。每组测试数据，以输入N为开始，0<N<=50，N是设备的总数量。接下来的N行包括V（设备的价值）和M（设备对应的序号），你可以假设所有的V不相等。如果输入的N是无效数据，则不执行那组数据。

输出：

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.

对于每组测试数据，输出一行，包括A，B，表示计算机学院和软件学院所得到的设备的价值，尽可能相等，你要保证A不小于B。