• ACM HDU 1157 Who's in the Middle (完全的水题,排序找中值的)


    Who's in the Middle

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 3360    Accepted Submission(s): 1646


    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
    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.
     

    Source
     

    Recommend
    mcqsmall
     
     
    #include<stdio.h>
    #include
    <algorithm>
    using namespace std;
    int a[10010];
    int main()
    {
    int n;
    while(scanf("%d",&n)!=EOF)
    {
    for(int i=0;i<n;i++)
    scanf(
    "%d",&a[i]);
    sort(a,a
    +n);
    printf(
    "%d\n",a[n/2]);
    }
    return 0;
    }

  • 相关阅读:
    Vue中使用WebSocket
    中断「interrupt」(IPI interrupt)
    ARM instruction misc
    ARMV8 datasheet学习笔记4:AArch64系统级体系结构之编程模型(2)- 寄存器
    android logd 原理及实现
    [FTRACE] vmlinux __mcount_loc section
    如何计算eMMC大小
    get the emmc capacity in kernel
    uboot misc
    GPT分区表详解
  • 原文地址:https://www.cnblogs.com/kuangbin/p/2124200.html
Copyright © 2020-2023  润新知