Zoj 3202 second-price auction ()

Source: Internet
Author: User

Second-price auction
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 Authentication 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 stored ed all the bids, you shoshould decide the winner and the amount of money he (or she) shoshould 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 PI indicates the I-th Bidder's bid. (0 <pI <= 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) shoshould pay is Y.

Sample Input

2
3
3 2 1
2
4 9
Sample output

1 2
2 4

Question: find the location of the maximum number and the second largest value.

 1 #include <iostream> 2 #include <cstring> 3 #include <string> 4 #include <cstdio> 5 using namespace std; 6 #define maxn 110 7 int a[maxn]; 8 int T, N; 9 bool cmp(int x, int y){10     return x<y;11 }12 int main(){13     scanf("%d", &T);14     while(T--){15         scanf("%d", &N);16         for(int i = 1; i <= N; i++) scanf("%d", &a[i]);17         18         int max = 0, max2 = 0, mark;19         for(int i = 1; i <= N; i++){20             if(a[i] > max){21                 max = a[i];mark = i;22             }23         }24         25         for(int i = 1; i <= N; i++){26             if(a[i] > max2 && a[i] < max ){27                 max2 = a[i];28             }29         }30         printf("%d %d\n", mark, max2);31     }32     33     return 0;34 }

 

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.