Every season at the herring shoals of Silverfin, someone must map a faster supply route. This year the task falls to Brevin, armed only with the vials register. Task: Print the lower median: the element at position floor((n-1)/2) after sorting (so for even n it is the smaller of the two middles). Input format: First line: n. Second line: n integers. Output format: Print the lower median. Constraints: 1 <= n <= 820; -1000000 <= a[i],x <= 1000000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 820; -1000000 <= a[i],x <= 1000000000.
