Preparando MOJI

Optimal Point on a Line

1000ms 262144K

Description:

You are given n points on a line with their coordinates xi. Find the point x so the sum of distances to the given points is minimal.

Input:

The first line contains integer n (1 ≤ n ≤ 3·105) — the number of points on the line.

The second line contains n integers xi ( - 109 ≤ xi ≤ 109) — the coordinates of the given n points.

Output:

Print the only integer x — the position of the optimal point on the line. If there are several optimal points print the position of the leftmost one. It is guaranteed that the answer is always the integer.

Sample Input:

4
1 2 3 4

Sample Output:

2

Informação

Codeforces

Provedor Codeforces

Código CF710B

Tags

brute forcesortings

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 09:08:47

Relacionados

Nada ainda