zoukankan      html  css  js  c++  java
  • HDU1157 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): 9411    Accepted Submission(s): 4538


    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

    水水水

    #include <stdio.h>
    #include <algorithm>
    using std::sort;
    #define maxn 10002
    
    int arr[maxn];
    
    int main()
    {
        int n, i;
        while(scanf("%d", &n) == 1){
            for(i = 0; i < n; ++i)
                scanf("%d", &arr[i]);
            sort(arr, arr + n);
            printf("%d
    ", arr[(n-1) >> 1]);
        }
        return 0;
    }


  • 相关阅读:
    python中的基础坑
    Django组件content-type使用方法详解
    数据库范式
    MySQL常见面试题索引、表设计
    python操作MySQL之pymysql模块
    MySQL备份与还原
    MySQL查询缓存
    MySQL索引及查询优化
    MySQL事务隔离之MVCC版本控制
    MySQL事务及实现、隔离级别及锁与优化
  • 原文地址:https://www.cnblogs.com/brucemengbm/p/6751854.html
Copyright © 2011-2022 走看看