Problem:
Score : 300 points

Problem Statement

You are given a sequence of length N: A_1, A_2, ..., A_N.
For each integer i between 1 and N (inclusive), answer the following question:

Find the maximum value among the N-1 elements other than A_i in the sequence.

Constraints

2 \leq N \leq 200000

1 \leq A_i \leq 200000

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1
:
A_N

Output

Print N lines. The i-th line (1 \leq i \leq N) should contain the maximum value among the N-1 elements other than A_i in the sequence.

Sample Input 1

3
1
4
3

Sample Output 1

4
3
4

The maximum value among the two elements other than A_1, that is, A_2 = 4 and A_3 = 3, is 4.

The maximum value among the two elements other than A_2, that is, A_1 = 1 and A_3 = 3, is 3.

The maximum value among the two elements other than A_3, that is, A_1 = 1 and A_2 = 4, is 4.

Sample Input 2

2
5
5

Sample Output 2

5
5

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod=1e9+7;
#define N 200005
int a[N],b[N]={0};
struct node
{
    int num,x;
    bool operator < (const node& b)const
    {
        return num<b.num;
    }
};
priority_queue<node>q;
int main()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)scanf("%d",&a[i]),b[a[i]]++;

     for(int i=1;i<=N-5;i++)
     {
         if(b[i])
         q.push({i,b[i]});
     }

     for(int i=1;i<=n;i++)
     {
         int flag=0;
         while(q.size())
         {
             node p=q.top();q.pop();
             if(p.num==a[i] && p.x==1){flag=1;continue;}
             else
             {
                 printf("%d\n",p.num);
                 q.push({p.num,p.x});
                 if(flag)
                 {
                     q.push({a[i],1});
                 }
                 break;
             }
         }
     }
    return 0;
}