2014ACM集训13级PK赛4-Second-price Auction
来源:互联网 发布:最新微信家校通源码 编辑:程序博客网 时间:2024/06/06 03:24
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 integerN, indicating the number of bidders. (2 <= N <= 100) The second line of each test case containsN integers separated by a space. The i-th integer Pi indicates thei-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 thex-th bidder is the winner and the amount of money he (or she) should pay isy.
Sample Input
233 2 124 9
Sample Output
1 22 4
水题一个,情景挺长,就是打印最大值的位置和第二大的数。
#include <string.h>#include <stdio.h>#include <stdlib.h>struct m{ int num; int no;}a[60001];int cmp(const void *a,const void *b){ m *ta = (m *)a; m *tb = (m *)b; return tb->num - ta->num;}int main(){ int N; scanf ("%d",&N); while (N--) { int n; scanf ("%d",&n); int i; for (i = 0;i < n;i++) { scanf ("%d",&a[i].num); a[i].no = i + 1; } qsort (a,n,sizeof(a[0]),cmp); printf ("%d %d\n",a[0].no,a[1].num); } return 0;}
- 2014ACM集训13级PK赛4-Second-price Auction
- 2014ACM集训13级PK赛2-Guess the Price
- 2014ACM集训13级PK赛4-K-Nice
- 2014ACM集训13级PK赛4-Light Bulb
- Second-price Auction
- Second-price Auction
- Codeforces386A. Second-Price Auction
- codeforces Second-Price Auction
- Second-price Auction
- zoj3202 Second-price Auction
- ZOJ3202-Second-price Auction
- A. Second-price Auction
- 2014寒假ACM集训13级PK赛-翻转排序
- 2014寒假ACM集训13级PK赛-购买矿石
- 2014ACM集训13级PK赛2-Somali Pirates
- 2014ACM集训13级PK赛2-Wu Xing
- 2014ACM集训13级PK赛2-Ordinal Numbers
- 2014ACM集训13级PK赛2-Conic Section
- ubuntu 12.04 arm-linux-gcc
- 1017. Queueing at Bank
- C++学习札记20140315
- codeforces好题记录——2B
- Qt之ignore()和accept()
- 2014ACM集训13级PK赛4-Second-price Auction
- codeforces好题记录——3D
- Makefile 中:= ?= += =的区别
- codeforces好题记录——4D
- 左旋字符串——编程珠玑和STL所想到的
- 位运算的巧妙运用
- 返回连续子序列,使得和最大(变形)
- Android中.9.png图片的使用过程和原理
- 理解同步与异步的概念