求中位数

FJ正在评估他的奶牛群以找出最平均的奶牛,即产奶量处于中间水平的奶牛。至少有一半的奶牛产奶量与这个中位数相同或更多,同时至少有一半的奶牛产奶量相同或更少。给定奇数头奶牛(1 <= N < 10,000)及其各自的产奶量(1...1,000,000),找出满足条件的中位产奶量。输入包含一头奶牛的产奶量,输出为中位产奶量。样例输入是5头奶牛,产奶量分别为1到5,输出为3,因为1和2低于3,4和5高于3。" 132904646,19694996,Java实现上传本地文件到阿里云OSS,"['Java', '阿里云', '云存储', 'OSS']
摘要由CSDN通过智能技术生成

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.

#include<stdio.h>
#include

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值