POJ2388 HDU1157 Who's in the Middle【中位数+排序＋水题】

最新推荐文章于 2019-06-12 16:26:11 发布

原创最新推荐文章于 2019-06-12 16:26:11 发布 · 1.5k 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#POJ2388 #HDU1157 #Whos in the Middle

ICPC-HDU 同时被 3 个专栏收录

708 篇文章

订阅专栏

ICPC-POJ

509 篇文章

订阅专栏

ICPC-HDU水题

73 篇文章

订阅专栏

本文介绍了一个简单的算法问题——求一组数字的中位数。该问题要求找到一个数，使得至少一半的数字大于或等于它，同时至少一半的数字小于或等于它。文章提供了两种C++实现方案，一种适用于单个测试用例，另一种适用于多个测试用例。

Who's in the Middle

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 44169		Accepted: 25455

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.

Source

USACO 2004 November

问题链接：POJ2388 HDU1157 Who's in the Middle。

问题简述：

　　输入n个数，找出一个数，满足至少有一半大于或等于它，并且有一半小于或等于它。

问题分析：

　　一个求中间数的问题。

程序说明：

　　这个程序与HDU1157应该是同一个问题，在POJ2388中提交可以通过，但是在HDU1157中提交出现Wrong Answer。经过调查，HDU1157要求输入多组测试用例，修改程序后就通过的，参见后一个代码。

参考链接：HDU1157 POJ2338 Who's in the Middle。

AC的C++语言程序如下（HDU1157未AC）：

/* POJ2388 Who's in the Middle */

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 10000;
int a[N];

int main()
{
    int n;

    // 输入数据
    cin >> n;
    for(int i=0; i<n; i++)
        cin >> a[i];

    // 排序
    sort(a, a+n);

    // 输出结果
    cout << a[n / 2] << endl;

    return 0;
}

AC的C++语言程序如下（两者都AC）：

/* POJ2388 HDU1157 Who's in the Middle */

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 10000;
int a[N];

int main()
{
    int n;

    // 输入数据
    while(cin >> n) {
        for(int i=0; i<n; i++)
            cin >> a[i];

        // 排序
        sort(a, a+n);

        // 输出结果
        cout << a[n / 2] << endl;
    }

    return 0;
}