who---解题思路

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 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 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.解题思路-----这道题最主要测试全面性，1--考虑1，2--考虑奇数和偶数（而且题中还不说，折磨我了两天）3--其实算法不难就排序和找中位数，不要放过任何一个细节！！！！！！！！

#include<stdio.h>
int  main()
{
    int a[10001],b,c,s1,n,i,j,k;
    while(scanf("%d",&c)!=EOF)
    {
        for(b=1; b<=c; b++)
        {
            scanf("%d",&a[b]);


        }for(i=1; i<c; i++)
        {
            for(j=1+i; j<=c; j++)
            {
                if(a[i]>a[j])
                {
                    s1=a[i];
                    a[i]=a[j];
                    a[j]=s1;
                }
            }
        }
        if(c==1)
            printf("%d\n",a[1]);
        else
        {
            if(c%2==1)
            {n=c/2+1;
        printf("%d\n",a[n]);}
        else
        {k=c/2;
        printf("%d\n",a[k]);}


        }}
return 0;
}