ZOJ 3202 Second-price Auction (模拟)

本文主要是介绍ZOJ 3202 Second-price Auction (模拟)，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

Second-price Auction http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3202

---

Time Limit: 1 Second       Memory Limit: 32768 KB

---

Do you know second-price auction? It's very simple but famous. In a second-price 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 second-highest 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 i-th integer P_i indicates the i-th 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 x-th 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

water.

完整代码：

/*30ms,0KB*/#include<cstdio>int main(void)
{int t, n;int i, j;scanf("%d", &t);while (t--){scanf("%d", &n);int p1 = -1, p2 = -1, x;for (i = 1; i <= n; i++){scanf("%d", &j);if (j > p1)p2 = p1, p1 = j, x = i;else if (j > p2)p2 = j;}printf("%d %d\n", x, p2);}
}

Source: The 6th Zhejiang Provincial Collegiate Programming Contest

这篇关于ZOJ 3202 Second-price Auction (模拟)的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---