CF984A Game

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

Game

Two players play a game.

Initially there are n n integers a1,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. n1 n − 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 n1 n − 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 n n integers a1,a2,,an(1ai106).

Output

Print one number that will be left on the board.

Examples
input

3
2 1 3

output

2

input

3
2 2 2

output

2

Note

In the first sample, the first player erases 3 3 and the second erases 1. 2 2 is left on the board.

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

题解

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

第一次看反了, get g e t A题 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();}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

ShadyPi

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值