ZOJ 3202 Second-price Auction
2017-02-24 22:06
148 查看
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 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 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) should pay is y.
Sample Input
Sample Output
[/code]
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 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) should pay is y.
Sample Input
2 3 3 2 1 2 4 9
Sample Output
1 2 2 4
#include <iostream> #include <stdlib.h> #include <stdio.h> #include <algorithm> #include <math.h> #include <stdlib.h> using namespace std; int n; struct Node { int tag; int value; }a[105]; int cmp(Node a,Node b) { return a.value>b.value; } int main() { int t; scanf("%d",&t); while(t--) { scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%d",&a[i].value); a[i].tag=i; } sort(a+1,a+n+1,cmp); printf("%d %d\n",a[1].tag,a[2].value); } return 0; }
[/code]
相关文章推荐
- ZOJ 3202 Second-price Auction (模拟)
- ZOJ 3202 Second-price Auction (A)
- ZOJ 3202 Second-price Auction(排序)
- ZOJ Problem Set - 3202 Second-price Auction
- ZOJ-3202-Second-price Auction【6th浙江省赛】
- ZOJ 3202 Second-price Auction
- ZOJ 3202 Second-price Auction
- zoj 3202 Second-price Auction
- zoj 3202
- The 6th Zhejiang Provincial Collegiate Programming Contest->ProblemA:Second-price Auction
- ZOJ 3202 (A)
- Second price auction - CodeForces 513 C 概率期望
- ZOJ3202-Second-price Auction
- A. Second-price Auction
- zoj 3202 Second-price Auction
- The 6th Zhejiang Provincial Collegiate Programming Contest->ProblemA:Second-price Auction
- The 6th Zhejiang Provincial Collegiate Programming Contest->ProblemA:Second-price Auction
- Second-price Auction
- Second-price Auction
- Second-price Auction