POJ2388Who‘s in the Middle题解

题目

链接

http://oi.hdoi.cn/training/6/problem/POJ-2388

字面描述

描述

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.

输入描述

Line 1: A single integer N

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

输出描述

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

样例

输入样例1

5
2
4
1
3
5

输出样例1

3

代码实现

此题太水了

#include<iostream>
#include<algorithm>
using namespace std;

const int maxn=1e4+10;
int n;
int a[maxn];
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	sort(a+1,a+n+1);
	printf("%d\n",a[n/2+1]);
	return 0;
}