984A Game

A. Game
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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. n1n−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 n1n−1 turns if both players make optimal moves.

Input

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

The second line contains nn integers a1,a2,,ana1,a2,…,an (1ai1061≤ai≤106).

Output

Print one number that will be left on the board.

Examples
input
Copy
3
2 1 3

output
Copy
2
input
Copy
3
2 2 2

output
Copy
2
Note

In the first sample, the first player erases 33 and the second erases 1122 is left on the board.

In the second sample, 22 is left on the board regardless of the actions of the players.

题意：两个人玩游戏，写n个数字在黑板上，第一个人先移除一个数，然后第二个人会移除一个数，然后轮流，求最后剩下的那个数，第一个人想使最后的那个数尽量小，第二个人想使最的那个数尽量大。经过n-1次，输出最后剩下的那个数。题解:模拟  剩下的数和n的个数的奇偶性有关，如果n为奇数最后剩下就是排序后a[n/2],否则就是a[n/2-1].
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,a[1010];
cin>>n;
for(int i=0; i<n; i++)
cin>>a[i];
sort(a,a+n);
if(n&1) cout<<a[n/2];
else cout<<a[n/2-1];
return 0;
}


• 广告
• 抄袭
• 版权
• 政治
• 色情
• 无意义
• 其他

120