poj2388Who's in the Middle（快速排序）

Who’s in the Middle
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 42776 Accepted: 24737
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 <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <queue>
#include <cmath>
using namespace std;
int out[10010];
int qiucksort(int a[],int l,int r)
{
    if(l<r)
    {
        int i,j,x;
        i=l,j=r,x=a[l];
        while(i<j)
        {
            while(i<j&&a[j]>=x)
            {
                j--;
            }
            if(i<j)
            {
                a[i++]=a[j];
            }
            while(i<j&&a[i]<x)
            {
                i++;
            }
            if(i<j)
            {
                a[j--]=a[i];
            }
        }
        a[i]=x;
        qiucksort(a,l,i-1);
        qiucksort(a,i+1,r);
    }
}

int main()
{
    int n;
    //int out[10010];
    scanf("%d",&n);
    int ave=(n+1)/2;
    int min=0;
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&out[i]);
    }
    qiucksort(out,1,n);
    //for(int i=1;i<=n;i++)
    //cout<<out[i]<<endl;
    cout<<out[ave]<<endl;
    return 0;
}