HDU--ACMSteps--Who's in the Middle

最新推荐文章于 2026-04-22 04:50:15 发布

原创最新推荐文章于 2026-04-22 04:50:15 发布 · 265 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#HDU--ACMSteps--Who's in the Middle

ACMSteps 专栏收录该内容

10 篇文章

订阅专栏

在给定的奇数头奶牛中，找到产奶量处于中间位置的那头奶牛，即至少一半的奶牛产奶量不低于此奶牛，且至少一半的奶牛产奶量不高于此奶牛。通过排序算法处理输入数据，找出并输出这个中间值。

Title:Who’s in the Middle

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

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

题目分析：
1、数据的存储：用一维数组存储N头奶牛的产奶量；
2、数据的处理：用sort函数进行排序即可；
3、数据的输出：排序后的数组输出其中间数据。
代码如下：

#include<iostream>
#include<algorithm>
using namespace std;
int a[10000];
int main()
{
	int n;
	int i=0;
	while(scanf("%d",&n)!=EOF)
	{
		for(i=0;i<n;i++)
		cin>>a[i];
	    
	    sort(a,a+i);
	    int mid=(i-1)/2;
	    cout<<a[mid]<<endl;
    }
    return 0;
 }

期待读者探讨：
题目中未说明有多组测试用例，但是依然要用while(scanf("%d",&n)!=EOF)这条语句来实现文件的多组数据读入，这是为什么呢？
比如代码这样会报错：

#include<iostream>
#include<algorithm>
using namespace std;
int a[10000];
int main()
{
	int n;
	cin>>n;
	int i=0;
	while(n--)
	{
		cin>>a[i];
		i++;
    }
    sort(a,a+i);
	int mid=(i-1)/2;
	cout<<a[mid]<<endl;
    return 0;
 }