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

    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

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

      

  • 相关阅读:
    web服务器IIS 64位无法调用32位驱动问题
    asp.net临时文件的重定向
    手机归属地演示代码
    空气质量监测演示代码
    地图坐标服务
    车辆违章查询演示代码
    Python第二天
    python第七天
    python操作MongoDB
    Python第一天
  • 原文地址:https://www.cnblogs.com/zhangliu/p/7057894.html
Copyright © 2011-2022 走看看