zoukankan      html  css  js  c++  java
  • ZOJ 3202 Second-price Auction (A)

    Second-price Auction
    Time Limit: 1 Second Memory Limit: 32768 KB
    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

    题意:求最大数的位置和第二大的数值。

     1 #include <iostream>
     2 #include <cstring>
     3 #include <string>
     4 #include <cstdio>
     5 using namespace std;
     6 #define maxn 110
     7 int a[maxn];
     8 int T, N;
     9 bool cmp(int x, int y){
    10     return x<y;
    11 }
    12 int main(){
    13     scanf("%d", &T);
    14     while(T--){
    15         scanf("%d", &N);
    16         for(int i = 1; i <= N; i++) scanf("%d", &a[i]);
    17         
    18         int max = 0, max2 = 0, mark;
    19         for(int i = 1; i <= N; i++){
    20             if(a[i] > max){
    21                 max = a[i];mark = i;
    22             }
    23         }
    24         
    25         for(int i = 1; i <= N; i++){
    26             if(a[i] > max2 && a[i] < max ){
    27                 max2 = a[i];
    28             }
    29         }
    30         printf("%d %d
    ", mark, max2);
    31     }
    32     
    33     return 0;
    34 }
  • 相关阅读:
    Java统计程序运行时间(转)
    有符号定点数的表示方法
    移位运算符
    索引
    self与super的区别(转)
    Java经典题型(未完成)
    ObjectiveC 的 self 和 super 详解
    边界计算与不对称边界
    各种排序总结
    运算符的优先级
  • 原文地址:https://www.cnblogs.com/titicia/p/3916453.html
Copyright © 2011-2022 走看看