题解 | #中位数#

#include <iostream>
#include<algorithm>
using namespace std;
bool comp(int lhs,int rhs)
{
    if(rhs<lhs)
    {
        return true;
    }
    else {
    return false;
    }
}
int main() {
    int N;
    int arr[10000];
    while(scanf("%d",&N)!=EOF)
    {
        int mid_num;
        for(int i=0;i<N;++i)
        {
            cin>>arr[i];
        }
        sort(arr,arr+N,comp);
        if(N%2==1)
        {
            mid_num=arr[N/2];
        }
        else {
        mid_num=(arr[N/2-1]+arr[N/2])/2;
        }
        cout<<mid_num<<endl;

    }
}
// 64 位输出请用 printf("%lld")