您的题解已送达！！！

#include <bits/stdc++.h>
using namespace std;
struct T
{
    string s;
    double a;
};
T r[45];
bool cmp(double x, double y)
{
    return x > y;
}
int main()
{
    int n, cnt1 = 0, cnt2 = 0;
    double a[45], b[45];
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
        cin >> r[i].s >> r[i].a;
        if (r[i].s == "male")
            a[++cnt1] = r[i].a;
        else
            b[++cnt2] = r[i].a;
    }
    sort(a + 1, a + cnt1 + 1);
    sort(b + 1, b + cnt2 + 1, cmp);
    for (int i = 1; i <= cnt1; i++)
        cout << fixed << setprecision(2) << a[i] << " ";
    for (int i = 1; i <= cnt2; i++)
        cout << fixed << setprecision(2) << b[i] << " ";
    return 0;
}

yasuo👀️

#include <iostream>
#include <cstdio>
#include <algorithm>
struct person{
    std::string xb; double tall;
}people[40];
bool yasuo(person a,person b){
    if(a.xb=="male"&&b.xb=="male")return a.tall<b.tall;
    if(a.xb=="female"&&b.xb=="female")return a.tall>b.tall;
    if(a.xb=="male"&&b.xb=="female")return 1; else return 0;}
int main(){
    int q; std::cin>>q;
    for(int i=0;i<q;i++)std::cin>>people[i].xb>>people[i].tall;
    std::sort(people,people+q,yasuo);
    for(int i=0;i<q;i++) printf("%.2f ",people[i].tall); return 0;}