Who's in the Middle | ||||||
| ||||||
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 There is only one data set in this problem. | ||||||
Output | ||||||
* Line 1: A single integer that is the median milk output. | ||||||
Sample Input | ||||||
5 2 4 1 3 5 | ||||||
Sample Output | ||||||
3 |
单纯的一道水题,就是找到中位数就好了,直接一波sort排序,输出第(n+1)/2个数就好了。以下是代码:
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n;
while(cin>>n){
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
sort(a,a+n);
cout<<a[n>>1]<<endl;
}
return 0;
}