ZOJ 3202 Second-price Auction
2017-02-17 21:39
183 查看
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 Piindicates 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
Sample Output
简单题,排个序就行
#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
, b
;
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;
}
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 Piindicates 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 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
, b
;
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【6th浙江省赛】
- ZOJ Problem Set - 3202 Second-price Auction
- ZOJ 3202 Second-price Auction
- zoj 3202 Second-price Auction
- ZOJ 3202 Second-price Auction (模拟)
- ZOJ 3202 Second-price Auction (A)
- ZOJ 3202 Second-price Auction(排序)
- ZOJ 3202 Second-price Auction
- ZOJ 3202 Second-price Auction
- zoj 2913 Bus Pass
- ZOJ-1524
- ZOJ 2562 More Divisors 反素数 DFS
- 【大水题】ZOJ 1049 I Think I need a Houseboat
- ZOJ 1610 Count the Colors 线段树 成段更新 单点求值
- ZOJ 3518 Unsafe Factor
- zoj 3612 ——Median
- ZOJ-3987 Numbers 2017CCPC秦皇岛站G题 (二进制乱搞、贪心)
- ZOJ 3640 Help Me Escape
- [迭代加深dfs] zoj 3768 Continuous Login