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

    Who's in the Middle
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 44499   Accepted: 25615

    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

     
    给N(1 <= N < 10,000)个数,求中位数
    不要用冒泡、插入、选择排序之类的O(n^2)算法
     
     1 #include<iostream>
     2 #include<algorithm>
     3 using namespace std;
     4 int const maxn = 10002;
     5 int num[maxn];
     6 int main()
     7 {
     8     int N;
     9     while(cin>>N)
    10     {
    11         int i=0;
    12         while(i<N)
    13         {
    14             cin>>num[i];
    15             i++;
    16         }
    17         sort(num,num+N);
    18         cout<<num[N/2]<<endl;
    19     }
    20     return 0;
    21 }
  • 相关阅读:
    Django之web本质
    Python之队列
    Python之阻塞IO模型与非阻塞IO模型
    *****Python之进程线程*****
    ***Python之UDP***
    Python之FTP实现
    Python之粘包
    Python之目录结构
    Python之套接字
    Linux内核分析:Linux内核启动流程分析
  • 原文地址:https://www.cnblogs.com/yxh-amysear/p/8435527.html
Copyright © 2011-2022 走看看