Second-price Auction
来源:互联网 发布:cae软件 编辑:程序博客网 时间:2024/05/19 14:55
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 <stdio.h>struct node{ int num; int money;};int main(){ int t,n,i,j,k; scanf("%d",&t); while(t--) { struct node shu[101],tw; scanf("%d",&n); for(i = 1;i<=n;i++) { scanf("%d",&shu[i].money); shu[i].num = i; } for(i = 1;i<n;i++) { for(j = 1;j<=n-i;j++) { if(shu[j].money < shu[j+1].money) { tw = shu[j]; shu[j] = shu[j+1]; shu[j+1] = tw; } } } printf("%d %d\n",shu[1].num,shu[2].money); } return 0;}
- 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
- zoj 3202 Second-price Auction
- ZOJ 3202 Second-price Auction
- zoj 3202 Second-price Auction
- ZOJ#3202:Second-price Auction
- ZOJ 3202 Second-price Auction
- ZOJ 3202 Second-price Auction
- ZOJ 3202 Second-price Auction (模拟)
- Codeforces 513C Second price auction (bruteforce)
- ZOJ 3202Second-price Auction(排序)
- 省赛热身赛第三场——Second-price Auction
- 配置交叉编译环境
- android优化
- 关于“显示器驱动程序已停止响应并且已成功恢复”的解决方案
- 基于阿里云服务器搭建SVN服务器
- Android中的Touch事件处理流程
- Second-price Auction
- 80ers' Memory
- 关于ios中得路径详细讲解
- 黑马程序员——银行业务调度管理系统
- Harris角点检测
- CDZSC_2014上半年组队赛(1)
- java中equals方法和“==”的比较
- A Stack or A Queue?
- CSS中需要注意的地方