HDU1157 Who's in the Middle_hdu who is in-优快云博客

本文链接：https://blog.youkuaiyun.com/lx0208/article/details/76146207

本文介绍了一道经典的算法题目——寻找中位数奶牛。该题要求在给定的一组奶牛产奶量中找到中位数。通过动态数组存储输入数据，并使用排序算法找出中位数，最后输出结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Who’s in the Middle

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

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.

Source
USACO 2004 November

Recommend
mcqsmall | We have carefully selected several similar problems for you: 1024 1081 1196 1087 1159

熟悉下，动态分配和排序

#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
    int n,m;
    while (scanf("%d", &n) != EOF)
    {
        vector<int>a;
        while (n--&&scanf("%d", &m) != EOF)
            a.push_back(m);
        sort(a.begin(), a.end());
        int len = a.size();
        printf("%d\n", a[len / 2]);
    }
    return 0;
}