HDU 1157 Who's in the Middle

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1157

Who's in the Middle

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10035    Accepted Submission(s): 4804

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
  
  

给你n个数，求中位数

排序之后取最中间的数即可，大水题

#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int a[100005];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        for(int i=0;i<n;i++) scanf("%d",&a[i]);
        sort(a,a+n);
        printf("%d\n",a[n/2]);
    }
    return 0;
}