HDU 1157.

Who's in the Middle

[align=left]Problem Description[/align]
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.

题意：求中位数。

就是个排序函数，然后求中间的数

#include<stdio.h>
#include<algorithm>
#include<iostream>
using namespace std;
int N,i,a[10100];
int main()
{
while(~scanf("%d",&N))
{
for(i=0; i<N; i++)
{
scanf("%d",&a[i]);
}
sort(a,a+N);
cout<<a[(N-1)/2]<<endl;
}
return 0;
}