首页 > 代码库 > POJ 2338 Who's in the Middle

POJ 2338 Who's in the Middle

2024-07-31 20:45:38   220人阅读

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

524135

Sample Output

3


题目大意：。。。翻译不明白 总体就是取最中间的数，一个排序就搞定

 1 #include<stdio.h> 2 main() 3 { 4  int n,i,j,a[10001],temp=0,flag; 5  while(scanf("%d",&n)!=EOF) 6  { 7  for(i=0;i<n;i++) 8  { 9   scanf("%d",&a[i]);                                10  }11  for(i=0;i<n-1;i++)12  {13   for(j=0;j<n-1-i;j++)14   {15    if(a[j]>a[j+1])16    {17     temp=a[j];18     a[j]=a[j+1];19     a[j+1]=temp;20    }                                     21   }22  }23  printf("%d\n",a[n/2]);24  }25  return 0;26 }

 

POJ 2338 Who's in the Middle


联系
我们