Who's in the Middle[HDU1157]

Who's in the Middle

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

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

Sample Output

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>

#include<algorithm>

using namespace std;

int a[];

int main()

{

    int n;

    while(scanf("%d",&n)!=EOF)

    {

        for(int i=;i<n;i++)

             scanf("%d",&a[i]);

        sort(a,a+n);

        printf("%d\n",a[n/]);

    }

    return ;

}

巴特西

Who's in the Middle[HDU1157]

最新文章

热门文章