ACMPRAC1 - Appetizer
Given n pairs of numbers of the form a, b find which pair has the highest ab value. If more than one pair have the same value, print the pair which occurs first in the input.
Input
Input starts with an integer T (≤ 100), denoting the number of test cases.
Each case starts with a line containing an integer n (1 ≤ n ≤ 1000) which denotes the number of pairs.
Next n lines contain two numbers a, b. (1 ≤ a, b ≤ 1000000)
Output
For each test case, print two numbers, separated by a space, which indicates the answer for the corresponding test case.
The answer for each test case must be in a new line.
Example
Input: 4 3 1 1 2 2 3 3 5 10 5 5 5 2 3 3 3 3 10 1 7 7 2 9 9 2 2 Output: 3 3 10 5 7 7 9 9
hide comments
|
Josef Ziegler:
2012-08-30 08:53:08
move to tutorial |
|
rahul kumar singh:
2012-08-30 05:54:06
@why i m getting wrong my logic is correct any worst test case provide please |
|
DaRksTar:
2012-08-30 08:52:58
Tutorial... |
|
(Tjandra Satria Gunawan)(曾毅昆):
2012-08-30 08:52:56
definitely tutorial |
|
Francky:
2012-08-29 08:21:00
Tutorial problem for sure.
|
Added by: | TouristGuide |
Date: | 2012-08-27 |
Time limit: | 1s-1.646s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |