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 (Clang 3.8.0) (judge verdict: Wrong Answer)

#include <iostream>

using namespace std;

const int maxn = 200000 + 10;

const int maxw = 200000 + 10;

inline int input() {
   int a = 0,w = 1;
   char ch = getchar();
   while(ch < '0' || ch > '9') {
       if (ch == '-') w = -1;
       ch = getchar();
    }
   while (ch >= '0' && ch <= '9')  {
       a = a * 10 + ch - '0';
       ch = getchar();
   }
   return a * w;
}

int s[maxn], cnt[maxw], b[maxn];

int main() {
    int n = input();
    for  (int i = 0; i < n; i++) {
        s[i] = input();
        cnt[s[i]]++;
    }
    for (int i = 1; i < maxw; i++) {
        cnt[i] += cnt[i - 1];
    }
    for (int i = n - 1; i >= 0; i--) {
        b[i] = s[--cnt[s[i]]];
    }
    for (int i = 0; i < n; i++) {
        if (s[i] == b[n - 1]) cout << b[n - 2] << endl;
        else cout << b[n - 1] << endl;
    }
    return 0;
}