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++ (GCC 5.4.1) (judge verdict: Runtime Error)

#include <iostream>
using namespace std;

int N;
int A[20001];

int main(){
  cin >> N;
  for (int i=0;i<N;++i) cin >> A[i];
  int max = 0;
  int i_max = 0;
  int max2 = 0;
  int i_max2 = 0;
  
  for (int k=0;k<N;++k){

    if (max < A[k]) {
      max = A[k];
      i_max = k;
    }else if (max >= A[k] && A[k] > max2) {
      max2 = A[k];
      i_max2 = k;
    }
  }
  for (int j=0;j<N;++j){
    if (j == i_max) {
      cout << max2 << endl;
    } else {
      cout << max << endl;
      }
  }   
}