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: 31149   Accepted: 18073

    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>
    using namespace std;
    
    int cmp(int x,int y)
    {
    	if(x<y)  return 1;
    	else return 0;
    }
    
    int main ()
    {
      int n,t,i,j;
      int a[1000005];
      while (~scanf("%d",&n))
      {
        for(i=0;i<n;i++)
    	  scanf("%d",&a[i]);
    
    	sort(a,a+n,cmp);
    	if(n%2==0) t=(n/2)-1;
    	else      t=n/2;
    	printf("%d
    ",a[t]);
      }
      return 0;
    }
    



  • 相关阅读:
    题解报告:hdu 2062 Subset sequence
    CSS3滑块菜单
    CSS3环形动画菜单
    可折叠显示的发光搜索表单
    Tab动画菜单
    侧边自定义滚动条
    css3条纹边框效果
    css3图片过滤效果
    CSS3图片悬停放大动画
    CSS3响应式侧边菜单
  • 原文地址:https://www.cnblogs.com/bhlsheji/p/5320859.html
Copyright © 2011-2022 走看看