#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n,b[10900];
    double sum=0;
    cin >> n;
    for(int i=1;i<=n;i++)
    {
        cin >> b[i];
    }
    sort (b+1,b+n+1);
    sum=0;
    for(int i=n;i>=1;i--)
    {
        if(n%2==0)
        {
            if(i==n/2)
            {
                sum=b[i]+b[i+1];
                cout << fixed << setprecision(1) << sum/2;
            }
        }
        else
        {
            if(i==n/2)
            {
                sum=b[i+1];
                cout << fixed << setprecision(1) << sum;
            }
        }
    }
}

没任何难度，除了sort要L5往上才学，但总体没难度

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n, a[15];
    cin >> n;
    for(int i=1;i<=n;i++)
        cin >> a[i];
    sort(a+1,a+n+1);
    if(n%2==1)
        cout<<a[n/2+1];
    else
        cout<<fixed<<setprecision(1)<<((a[n/2]+a[n/2+1])*1.0) / 2.0;
    return 0;
}