贪心算法1之1016

最新推荐文章于 2024-04-22 23:59:33 发布

德国战车E75

最新推荐文章于 2024-04-22 23:59:33 发布

阅读量364

点赞数 1

CC 4.0 BY-SA版权

分类专栏： ACM算法文章标签：贪心算法

本文链接：https://blog.youkuaiyun.com/ghost_heng_007/article/details/50958037

ACM算法专栏收录该内容

56 篇文章

订阅专栏

本文介绍了一种通过简单排序算法来找到一组数据中位数的方法，适用于奇数个元素的数据集，具体应用案例为计算一群奶牛产奶量的中位数。

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

1 题目编号：1016 problemQ

2 题目内容：

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 <br> <br>* 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 解题思路形成过程：此题为简单的求中位数运算，用普通的排序算法即可，即可以使用双for循环。

4 感想：此题我在做时有一个疑惑，即milk output 并没有给出具体的范围，所以对于数组的长度也不好确定，只能自己估量着确定一个模糊的范围进行测试。

5 代码：

#include<iostream>
#include<stdlib.h>
using namespace std;
int main()
{
int iNum;
int iOutput[100010];
cin >> iNum;
for (int i = 0; i < iNum; i++)
{
cin >> iOutput[i];
}
for (int j = 0; j < iNum; j++)
{
for (int k = j + 1; k < iNum; k++)
{
if (iOutput[j]>iOutput[k])
{
int temp;
temp = iOutput[j];
iOutput[j] = iOutput[k];
iOutput[k] = temp;
}
}
}
cout << iOutput[(iNum - 1) / 2] << endl;
return 0;
}