HDU 1157 Who's in the Middle

最新推荐文章于 2024-07-21 14:30:00 发布

原创最新推荐文章于 2024-07-21 14:30:00 发布 · 691 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#integer #output #input #each #ini

hdu ACM 水题128题专栏收录该内容

61 篇文章

订阅专栏

本文介绍了一道经典的算法题目，需要找出一组奶牛中产奶量处于中间位置的那只，即“中位数”奶牛。通过给出的示例和代码实现，展示了如何使用排序算法来快速找到这个问题的答案。

Who's in the Middle

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

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

  
   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.

Source

USACO 2004 November

Recommend

mcqsmall

分析：简单排序。。把中间那个数输出

代码：

#include<stdio.h>
#include<algorithm>
using namespace std;
int a[10010];
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        for(int i=0;i<n;i++)
             scanf("%d",&a[i]);
        sort(a,a+n);
        printf("%d\n",a[n/2]);
    }    
    return 0;
}