通讯录编排

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

struct in
{
    string tojid;
    int num;
    string name;
    int n;
    int y;
    int r;
} info[100];

bool cmp(struct in a,struct in b)
{
    if(a.name<b.name) return 1;
    else if(a.name==b.name)
    {
        if(a.y<b.y) return 1;
        else if(a.y==b.y)
        {
            if(a.r<b.r) return 1;
            else if(a.r==b.r)
            {
                if(a.tojid<b.tojid) return 1;
                else return 0;
            }
            else return 0;
        }
        else return 0;

    }
    else return 0;
}

int main()
{
    int n;
    char t;
    while(cin>>n)
    {
        for(int i=0;i<n;i++)
        {
            cin>>info[i].tojid>>info[i].num>>info[i].name>>info[i].n>>t>>info[i].y>>t>>info[i].r;
        }
        sort(info,info+n,cmp);
        for(int i=0;i<n;i++)
        {
            cout<<info[i].tojid<<' '<<info[i].num<<' '<<info[i].name<<' '<<info[i].n<<'-'<<info[i].y<<'-'<<info[i].r<<endl;
        }
    }
    return 0;
}