zoukankan      html  css  js  c++  java
  • POJ 2388:Who's in the Middle

    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 31015   Accepted: 17991

    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.

    一道排序水题。


    #include<cstdio>
    #include<stdlib.h>
    #include<cstring>
    #include<algorithm>
    #include<iostream>
    
    using namespace std;
    
    const int M = 10000 + 5;
    int cow[M];
    
    int main()
    {
        int n;
        while(scanf("%d", &n)!=EOF)
        {
            memset(cow, 0, sizeof(cow));
            for(int i=0; i<n; i++)
                scanf("%d", &cow[i]);
            sort(cow, cow+n);
            printf("%d
    ", cow[n/2]);
        }
    
        return 0;
    }
    



  • 相关阅读:
    实现毛玻璃效果
    iOS-调用系统的短信和发送邮件功能,实现短信分享和邮件分享
    集成环信
    HTTP 方法:GET 对比 POST
    虚拟DOM
    javascript的回调函数 同步 异步
    jQuery中的Deferred和promise
    web性能
    JSONP
    java
  • 原文地址:https://www.cnblogs.com/clnchanpin/p/6798449.html
Copyright © 2011-2022 走看看