ZOJ3202-Second-price Auction
来源:互联网 发布:战斗吧剑灵刻印数据 编辑:程序博客网 时间:2024/05/29 19:30
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
233 2 124 9
Sample Output
1 22 4
Author: CAO, Peng
Source: The 6th Zhejiang Provincial Collegiate Programming Contest
题意:有n个投标人,最高者获得物品,并且支付第二高投标价,问中标者和他需要支付的钱
#include <iostream>#include <cstdio>#include <string>#include <cstring>#include <algorithm>#include <queue>#include <vector>#include <set>#include <stack>#include <map>#include <climits>using namespace std;#define LL long longstruct node{ int id; int sum;}x[105];bool cmp(node a,node b){ return a.sum>b.sum;}int main(){ int t; scanf("%d",&t); while(t--) { int n; scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%d",&x[i].sum); x[i].id=i; } sort(x+1,x+1+n,cmp); printf("%d %d\n",x[1].id,x[2].sum); } return 0;}
- zoj3202 Second-price Auction
- ZOJ3202-Second-price Auction
- Second-price Auction
- Second-price Auction
- Codeforces386A. Second-Price Auction
- codeforces Second-Price Auction
- 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
- 备份的重要性
- 用Python&OpenGL采用数值微分法和中点画圆法写图形学作业——会动的时钟
- Dynamics CRM 流程错误 simultaneous connections limit reached for organization
- Shell全局变量、局部变量与特殊变量笔记总结
- React Native 实战系列二
- ZOJ3202-Second-price Auction
- Eclipse中高亮显示velocity模版页面
- mybatis:Parameter 'list' not found. Available parameters are [templateId, param1, param2, valueList]
- Android GridView长按拖动,删除
- linux task_struct的结构注释
- 10815
- C#遍历DataSet中数据的几种方法总结
- Bootstrap排版
- ML_3_Linear_regression