ZOJ 3202 Second-price Auction
来源:互联网 发布:pdf转mobi软件 编辑:程序博客网 时间:2024/06/06 01:43
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.
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 Piindicates the i-th bidder's bid. (0 < Pi <= 60000) You may assume that the highest bid is unique.
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.
233 2 124 9
1 22 4
简单题,排个序就行
#include<map>#include<ctime>#include<cmath> #include<queue> #include<string>#include<vector>#include<cstdio> #include<cstring> #include<iostream>#include<algorithm> using namespace std;#define ms(x,y) memset(x,y,sizeof(x)) #define rep(i,j,k) for(int i=j;i<=k;i++) #define per(i,j,k) for(int i=j;i>=k;i--) #define loop(i,j,k) for (int i=j;i!=-1;i=k[i]) #define inone(x) scanf("%d",&x) #define intwo(x,y) scanf("%d%d",&x,&y) #define inthr(x,y,z) scanf("%lf%lf%lf",&x,&y,&z) typedef long long LL;const int low(int x) { return x&-x; }const int INF = 0x7FFFFFFF;const int mod = 1e9 + 7;const int N = 1e5 + 10;int T, n, a[N], b[N];bool cmp(int x, int y){return a[x] > a[y];}int main(){for (inone(T); T--;){inone(n);rep(i, 1, n) inone(a[i]), b[i] = i;sort(b + 1, b + n + 1, cmp);printf("%d %d\n", b[1], a[b[2]]);}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)
- C# Winform 嵌入资源
- find 命令小结
- Google Cardboard、 GVR Unity3D 开发
- Maven权威指南
- 处理学生信息
- ZOJ 3202 Second-price Auction
- 6、一维数组
- set 理论知识(学习)
- H5初学
- 目前遇到的matlab的一些函数用法
- 【Matlab】Matlab中几个数值积分函数的比较和优缺点
- 网页版2048-原型、原型链的应用
- 最简单的openCV语言,读取和显示一张图片
- 集合 和 泛型