CF984A Game

原题链接：http://codeforces.com/contest/984/problem/A

Game

Two players play a game.

Initially there are nnn integers a1,a2,⋯,an" role="presentation" style="position: relative;">a1,a2,⋯,ana1,a2,⋯,ana_1,a_2,\cdots,a_n written on the board. Each turn a player selects one number and erases it from the board. This continues until there is only one number left on the board, i. e. n−1n−1n−1 turns are made. The first player makes the first move, then players alternate turns.

The first player wants to minimize the last number that would be left on the board, while the second player wants to maximize it.

You want to know what number will be left on the board after n−1n−1n−1 turns if both players make optimal moves.

Input

The first line contains one integer $n (1≤n≤1000) — the number of numbers on the board.

The second line contains nnn integers a1,a2,⋯,an(1≤ai≤106)" role="presentation" style="position: relative;">a1,a2,⋯,an(1≤ai≤106)a1,a2,⋯,an(1≤ai≤106)a_1,a_2,\cdots,a_n (1≤a_i≤10^6).

Output

Print one number that will be left on the board.

Examples

input

3
2 1 3

output

input

3
2 2 2

output

Note

In the first sample, the first player erases 333 and the second erases 1" role="presentation" style="position: relative;">111. 222 is left on the board.

In the second sample, 2" role="presentation" style="position: relative;">222 is left on the board regardless of the actions of the players.

题解

贪心一下，第一个人肯定会选大的，第二个人选小的，最后剩的就是中间的了。

第一次看反了，getgetget A题−1−1-1，~~我怎么这么菜~~。

代码

#include<bits/stdc++.h>
using namespace std;
const int M=1005;
int a[M],n;
void in(){scanf("%d",&n);for(int i=1;i<=n;++i)scanf("%d",&a[i]);}
void ac(){sort(a+1,a+1+n);printf("%d",a[(n+1)/2]);}
int main(){in();ac();}

CF984A Game相关推荐

Codeforces 刷题记录(已停更)
Codeforces 每日刷题记录 (已停更) 打'+'是一些有启发意义的题目,部分附上一句话题解,每日更新3题,大部分题目较水. Day ID Problem Tutorial Note 1 1 + ...

CF984A Game

Game

Input

Output

Examples

input

output

input

output

Note

题解

代码

CF984A Game相关推荐

最新文章

热门文章