设为首页 加入收藏

TOP

poj 2388 Who's in the Middle
2015-07-24 05:40:45 来源: 作者: 【 】 浏览:5
Tags:poj 2388 Who' the Middle
Who's in the Middle
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 31149 Accepted: 18073

Description

FJ is surveying his herd to find the most average cow. He wants to know how much milk this 'median' cow gives: half of the cows give as much or more than the median; half give as much or less.

Given an odd number of cows N (1 <= N < 10,000) and their milk output (1..1,000,000), find the median amount of milk given such that at least half the cows give the same amount of milk or more and at least half give the same or less.

Input

* Line 1: A single integer N

* Lines 2..N+1: Each line contains a single integer that is the milk output of one cow.

Output

* Line 1: A single integer that is the median milk output.

Sample Input

5
2
4
1
3
5

Sample Output

3


#include
  
   
#include
   
     using namespace std; int cmp(int x,int y) { if(x
    
     


】【打印繁体】【投稿】【收藏】 【推荐】【举报】【评论】 【关闭】 【返回顶部
分享到: 
上一篇二叉树三种遍历非递归算法 下一篇HDU3746-Cyclic Nacklace(KMP)

评论

帐  号: 密码: (新用户注册)
验 证 码:
表  情:
内  容: