codeforces710B

Posted 2021-02-14 gaojunonly1

Optimal Point on a Line

 CodeForces - 710B 

You are given n points on a line with their coordinates x_i. 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·10⁵) — the number of points on the line.

The second line contains n integers x_i ( - 10⁹ ≤ x_i ≤ 10⁹) — 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.

Example

Input

4
1 2 3 4

Output

2

sol：就是找个中位数，分奇偶讨论即可

#include <bits/stdc++.h>
using namespace std;
typedef int ll;
inline ll read()
{
    ll s=0;
    bool f=0;
    char ch=‘ ‘;
    while(!isdigit(ch))
    {
        f|=(ch==‘-‘); ch=getchar();
    }
    while(isdigit(ch))
    {
        s=(s<<3)+(s<<1)+(ch^48); ch=getchar();
    }
    return (f)?(-s):(s);
}
#define R(x) x=read()
inline void write(ll x)
{
    if(x<0)
    {
        putchar(‘-‘); x=-x;
    }
    if(x<10)
    {
        putchar(x+‘0‘); return;
    }
    write(x/10);
    putchar((x%10)+‘0‘);
    return;
}
#define W(x) write(x),putchar(‘ ‘)
#define Wl(x) write(x),putchar(‘
‘)
const int N=300005;
int n,A[N];
int main()
{
    int i;
    R(n);
    for(i=1;i<=n;i++) R(A[i]);
    sort(A+1,A+n+1);
    if(n&1) Wl(A[(n+1)>>1]);
    else Wl(A[n>>1]);
    return 0;
}
/*
input
4
1 2 3 4
output
2
*/

View Code