题解 | 中位数

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int MAXN=10000;
int arr[MAXN];
bool compare(const int a,const int b){
    return a<b;
}
int main(){
    int n;
    while(scanf("%d",&n) != EOF){
        if(n == 0){
            break;
        }
        for(int i=0;i<n;i++){
            scanf("%d",&arr[i]);
        }
        sort(arr,arr+n,compare);
        int ans=0;
        if(n%2==0){
            ans = (arr[n/2-1]+arr[n/2])/2;
        }else{
            ans = arr[(n-1)/2];
        }
        cout<<ans<<endl;
    }
    return 0;
}