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: Wrong Answer)

#include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int main() 
{ 
	SPEED
    int n;
    cin >> n;
    int arr[n];
    for (int i = 0; i < n; ++i)
    {
    	cin >> arr[i];
    }
    int larg = arr[0];
    int idx = 0;
    for (int i = 1; i < n; ++i)
    {
    	if (arr[i]>larg)
    	{
    		larg = arr[i];
    		idx = i;
    	}
    }

    int larg2 = -1;
    for (int i = 0; i < n; ++i)
    {
    	if (arr[i]>larg2 && arr[i]<larg)
    	{
    		larg2 = arr[i];
    	}
    }
    if (larg2==-1)
    {
    	larg2 = larg;
    }

    int brr[n];
    for (int i = 0; i < n; ++i)
    {
    	brr[i] = larg;
    }
    brr[idx] = larg2;
    for (int i = 0; i < n; ++i)
    {
    	cout << brr[i] << '\n';
    }
    return 0;      
}