杭电1157（sort函数）

头文件是#include<algorithm>比如说数组a[5]={1,5,4,2,3};当你用sort(a,a+5)时，就把数组a从小到大排序了for(i=0;i<5;i++){    printf("%d \n",a[i]);}输出为1 2 3 4 5

Who's in the Middle
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.

* Line 1: A single integer N 

* Lines 2..N+1: Each line contains a single integer that is the milk output of one cow

* Line 1: A single integer that is the median milk output.

5

2

4

1

3

5

3

#include <stdio.h>#include <algorithm>#include <iostream>using namespace std;int main(){   int n, i;   int arr[10005];   while(scanf("%d", &n)!=EOF)   {       for(i=0; i<n; i++)       scanf("%d", &arr[i]);   sort(arr, arr+n);   printf("%d\n", arr[n/2]);   }   return 0;}