代码

#include <iostream>
#include <algorithm>
using namespace std;

struct People{
    string name;
    int y, m, d;
}p[105];

bool cmp(People a, People b){
    if (a.y != b.y){
        return a.y < b.y;
    } else if (a.y == b.y && a.m != b.m){
        return a.m < b.m;
    }else{
        return a.d < b.d;
    }
}

int main(){
//	freopen("in.txt", "r", stdin);
//	freopen("out.txt", "w", stdout);
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++){
        cin >> p[i].name >> p[i].y >> p[i].m >> p[i].d;
    }
    sort (p + 1, p + n + 1, cmp);
    for (int i = 1; i <= n; i++){
        cout << p[i].name << "\n";
    }
    return 0;
}

最后#6WA，实在看不出来什么问题