题解 | #中位数#

#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
const int N=100010;
int a[N];
int main() {
    int n;
    while (cin >> n&&n!=0) {   //还能这样写
        int z=0;
        for (int i = 1; i <= n; i++) cin >> a[i];
        sort(a+1, a+n+1);   //sort();里面是地址，不是具体数一般是sort(a,a+n);这个是初始地址为1
        if (n % 2 != 0)     z = a[ (n+1) / 2];
        else  z = (a[n / 2] + a[n / 2 + 1]) / 2;
        cout << z << endl;
    }
    return 0;
}