HDU 1157 JAVA

最新推荐文章于 2021-10-13 14:56:59 发布

海那边的小萌男

最新推荐文章于 2021-10-13 14:56:59 发布

阅读量289

点赞数

CC 4.0 BY-SA版权

分类专栏： java技术 hdu--ACM 文章标签： java

本文链接：https://blog.youkuaiyun.com/weixin_37720904/article/details/72724251

hdu--ACM 同时被 2 个专栏收录

143 篇文章

订阅专栏

java技术

51 篇文章

订阅专栏

本文介绍了一个关于寻找一群奶牛中牛奶产量中位数的问题。通过给出的N头奶牛及其牛奶产量，使用Java实现了一个算法来找到使得一半奶牛产奶量不低于此值而另一半不高于此值的中位数。该算法首先读取输入数据，然后对奶牛的产奶量进行排序，并输出位于中间位置的奶牛产奶量。

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

Who’s in the Middle

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
S

Sample Output

3

package hlh;

import java.util.Arrays;
import java.util.Scanner;

public class p1157 {
    /**
     * @author 胡龙华
     */

    public static void main(String[] args) {
        Scanner  sc = new Scanner(System.in);
        while(sc.hasNext()){
            int n = sc.nextInt();
            int a [] = new int [n];
            for(int i=0;i<n;i++){
                a[i] = sc.nextInt();
            }
            Arrays.sort(a);
            System.out.println(a[n/2]);

        }

    }

}