Codeforces386A. Second-Price Auction

A. Second-Price Auction

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

In this problem we consider a special type of an auction, which is called the second-price auction. As in regular auction n bidders place a bid which is price a bidder ready to pay. The auction is closed, that is, each bidder secretly informs the organizer of the auction price he is willing to pay. After that, the auction winner is the participant who offered the highest price. However, he pay not the price he offers, but the highest price among the offers of other participants (hence the name: the second-price auction).

Write a program that reads prices offered by bidders and finds the winner and the price he will pay. Consider that all of the offered prices are different.

Input

The first line of the input contains n (2 ≤ n ≤ 1000) — number of bidders. The second line contains n distinct integer numbersp1, p2, ... pn, separated by single spaces (1 ≤ pi ≤ 10000), where pi stands for the price offered by the i-th bidder.

Output

The single output line should contain two integers: index of the winner and the price he will pay. Indices are 1-based.

Sample test(s)

input

2
5 7

output

2 5

input

3
10 2 8

output

1 8

input

6
3 8 2 9 4 14

output

6 9

解题报告：

只要输出第一个数是第一大的下标和第二大的值即可。

#include <iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
struct node{
    int pi,t;
}p[1010];
bool cmp(const node &a,const node &b){
    return a.pi>b.pi;
}
int main(){
    int i,n;
    scanf("%d",&n);
    for(i=0;i<n;i++){
        scanf("%d",&p[i].pi);
        p[i].t=i+1;
    }
    sort(p,p+n,cmp);
    printf("%d %d\n",p[0].t,p[1].pi);
    return 0;
}