第一个题解

#include<iostream>
#include<algorithm>
using namespace std;
struct gan{
    string name;
    int dar;
    int score;
    int money;
    int id;
}a[200010];
bool cyp(gan x , gan y){
    if(x.dar != y.dar)return x.dar > y.dar;
    else if(x.score != y.score)return x.score > y.score;
    else if(x.money != y.money)return x.money > y.money;
    else return x.id < y.id;
}
int main(){
    int n;
    cin >> n;
    for(int i = 1;i <= n;i++){
        cin >> a[i].name;
        cin >> a[i].dar;
        cin >> a[i].score;
        cin >> a[i].money;
        a[i].id = i;
        if(a[i].dar > 200)cout << a[i].name << endl;
    }
    sort(a + 1,a + n + 1,cyp);
    for(int i = 1;i <= n;i++){
        if(a[i].dar <= 200){
            cout << a[i].name << '\n';
        }else{
            continue;
        }
    }
    return 0;
}