最后两个wa

#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
struct fc
{
    string  x;
    int y;
    int z;
    int d;
    int id;
}a[50004];
unsigned int n;
bool com(fc a, fc b)
{
    if (a.y == b.y)
    {
        if (a.z == b.z)
        {
            if (a.d == b.d)
            {
                return a.id < b.id;
            }
            else
            {
                return a.d < b.d;
            }
        }
        else
        {
            return a.z < b.z;
        }
    }
    else
    {
        return a.y < b.y;
    }
}
int main()
{
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        cin >> a[i].x >> a[i].y >> a[i].z>>a[i].d;
        a[i].id = i;
    }
    sort(a, a + n,com);
    for (int j = 0; j < n; j++)
    {
        cout << a[j].x << endl;
    }
    return 0;
}