A30609.病人排队 题解

经典的结构体排序

#include <bits/stdc++.h>
using namespace std;
struct patient{
    string id;
    int num,age;//num表示登记的顺序
}a[105];
bool cmp(patient x,patient y){
    if (x.age>=60){
        if (x.age!=y.age) return x.age>y.age;
        return x.num<y.num;
    }
    return x.num<y.num;
}
int n;
int main(){
    cin>>n;
    for (int i=1;i<=n;i++){
        cin>>a[i].id>>a[i].age;
        a[i].num=i;
    }
    sort(a+1,a+n+1,cmp);
    for (int i=1;i<=n;i++){
        cout<<a[i].id<<endl;
    }
    return 0;
}