# Who's in the Middle

95人阅读 评论(0)

Problem 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<iostream>
#include<algorithm>
using namespace std;

bool cmp(int a,int b)
{
return a>b;
}

int main()
{
int num,i;
int arr[10050];
while(scanf("%d",&num)!=EOF)
{
for(i=0;i<num;i++)
cin>>arr[i];
sort(arr,arr+num,cmp);
cout<<arr[(num-1)/2]<<endl;
}
return 0;
}  

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：90016次
• 积分：2433
• 等级：
• 排名：第16057名
• 原创：165篇
• 转载：14篇
• 译文：0篇
• 评论：34条
最新评论