Two players play a game.
Initially there are nn integers a1,a2,…,ana1,a2,…,an 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−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−1 turns if both players make optimal moves.InputThe first line contains one integer nn (1≤n≤10001≤n≤1000) — the number of numbers on the board.
The second line contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤1061≤ai≤106).OutputPrint one number that will be left on the board.Examples
Input
3
2 1 3
Output
2
Input
3
2 2 2
Output
2
NoteIn the first sample, the first player erases 33 and the second erases 11. 22 is left on the board.
In the second sample, 22 is left on the board regardless of the actions of the players.
思路:一个人从大往下删除数字,另外一个人从小往大删除数字,所以最后留下的数字需要分情况讨论
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int n;
int a[1010];
int main() {
cin >> n;
for(int i = 0; i < n; i++) cin >>a[i];
sort(a, a + n);
if(n % 2 == 1)
cout <<a[n/2] <<endl;
else
cout <<a[(n-1) / 2] <<endl;
return 0;
}