Third Distinct Maximum

Difficulty: 1100 3000 ms 128 MB

implementation

Print the third largest distinct value; if fewer than three distinct values exist, print the maximum instead.

Input: the first line has N; the second line has N integers.

Output: the third distinct maximum, or the maximum.

Constraints:

• 1 ≤ N ≤ 10⁵
• −10⁹ ≤ a_i ≤ 10⁹

Sample Tests

5
3 2 1 2 3

1

2
1 2

2

Read the Editorial