ZOJ#3202:Second-price Auction
来源:互联网 发布:浙江大学翁恺 c语言pat 编辑:程序博客网 时间:2024/05/29 11:59
Memory Limit: 32768KB
64bit IO Format: %lld & %llu
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 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
Source
The 6th Zhejiang Provincial Collegiate Programming Contest
AC代码如下:
#include<iostream>#include<algorithm>using namespace std;int main(){ int T; cin>>T; while(T--) { int N,a[101],b[101]; cin>>N; for(int i=0;i<N;i++) { cin>>a[i]; b[i]=a[i]; } sort(b,b+N); for(int i=0;i<N;i++) { if(a[i]==b[N-1]) cout<<i+1<<" "; } cout<<b[N-2]<<endl; } return 0;}
- 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 (模拟)
- ZOJ 3202Second-price Auction(排序)
- ZOJ-3202-Second-price Auction【6th浙江省赛】
- 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
- Codeforces 513C Second price auction (bruteforce)
- 拖动浮层(div等任何标签)
- dubbo配置文件报错..
- 【PAT甲级】1017. Queueing at Bank (25)
- Opencv实现盲水印技术(二)——使用maven构建Java Web工程
- PM2.5传感器
- ZOJ#3202:Second-price Auction
- android developer tiny share-20161009
- android常用网址大全
- iOS 打包应用并使用Application Loader上传spa包到AppStore
- Redis与spring的整合遇到问题
- JNI NDK AOP架构设计 UML建模 IOC架构设计 MVP架构等安卓专有名词简介
- 一道让我踏进坑的字符串题目
- 怎么样把pdf压缩到最小
- C# Left, Right and Mid函数