
ZOJ Problem Set  3202
Do you know secondprice auction? It's very simple but famous. In a secondprice auction, each potential buyer privately submits, perhaps in a sealed envelope or over a secure connection, his (or her) bid for the object to the auctioneer. After receiving all the bids, the auctioneer then awards the object to the bidder with the highest bid, and charges him (or her) the amount of the secondhighest bid. Suppose you're the auctioneer and you have received all the bids, you should decide the winner and the amount of money he (or she) should pay. Input There are multiple test cases. The first line of input contains an integer T(T <= 100), indicating the number of test cases. Then T test cases follow. Each test case contains two lines: The first line of each test case contains only one integer N, indicating the number of bidders. (2 <= N <= 100) The second line of each test case contains N integers separated by a space. The ith integer P_{i} indicates the ith bidder's bid. (0 < P_{i} <= 60000) You may assume that the highest bid is unique. Output For each test case, output a line containing two integers x and y separated by a space. It indicates that the xth bidder is the winner and the amount of money he (or she) should pay is y. Sample Input 2 3 3 2 1 2 4 9 Sample Output 1 2 2 4 Author: CAO, Peng Source: The 6th Zhejiang Provincial Collegiate Programming Contest 