标签：acm算法   amp   c   math.h   printf   

我竟然在这么水的题目上WA了一次，可是它没说要多组数据啊。我的英语啊！！！上题目：

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

Hint
 
INPUT DETAILS: 

Five cows with milk outputs of 1..5 

OUTPUT DETAILS: 

1 and 2 are below 3; 4 and 5 are above 3.
 

 

 

 

#include <stdio.h>
#define wbx 10005
int a[wbx];
#include <string.h>
#include <algorithm>
using namespace std;
void solve()
{
    int n,i;
    while(~scanf("%d",&n))
	{
		memset(a,0,sizeof(a));
		for(i=0;i<n;i++)
			scanf("%d",&a[i]);
		sort(a,a+n);
		printf("%d\n",a[n/2]);
	}
}
int main()
{
	solve();
	return 0;
}

HDU 1157

标签：acm算法   amp   c   math.h   printf   

原文地址：http://blog.csdn.net/sky_miange/article/details/41942479