zoj3202 Second-price Auction

最新推荐文章于 2018-08-20 10:36:00 发布

原创最新推荐文章于 2018-08-20 10:36:00 发布 · 447 阅读

0 ·

CC 4.0 BY-SA版权

水题专栏收录该内容

31 篇文章

订阅专栏

本文详细介绍了第二价格拍卖的基本原理，通过实例演示了如何使用C++代码实现这一算法，包括输入处理、数据排序及输出结果等关键步骤。

Second-price Auction

Time Limit: 1000MS

Memory Limit: 32768KB

64bit IO Format: %lld & %llu

Submit Status

Description

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

Sample Output

1 2
2 4

Source

The 6th Zhejiang Provincial Collegiate Programming Contest

分析：

水题。

ac代码：

#include <iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int a[105];
int main()
{
    int t,n,i,j;
    int ans,pos;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        ans=0;
        pos=-1;
        for(i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
        }
        for(i=0;i<n;i++)
        {
            if(a[i]>ans)
            {
                ans=a[i];
                pos=i;
            }
        }
        sort(a,a+n);
        printf("%d %d\n",pos+1,a[n-2]);
    }
    return 0;
}