开门人和关门人

每天的记录在第一行给出记录的条目数M (M > 0 )，下面是M行，每行的格式为 

证件号码 签到时间 签离时间 

其中时间按“小时:分钟:秒钟”（各占2位）给出，证件号码是长度不超过15的字符串。

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

typedef struct node{
    string id;
    long long start;
    long long end;
    node(string str,long long s,long long e){
        id = str;
        start = s;
        end = e;
    }
}Record;

int cmp1(Record r1,Record r2)
{
    return r1.start<r2.start;
}

int cmp2(Record r1,Record r2)
{
    return r1.end>r2.end;
}

char ch[20];
int h1,h2,m1,m2,s1,s2,t1,t2;;
int M;
vector<Record> records;
string first,last;

/*
    按照签到时间，离开时间分别排序，得出开门人与关门人 
*/

int main()
{
    while(cin>>M){
        for(int i = 0 ; i < M ; i++){
            scanf("%s %02d:%02d:%02d %02d:%02d:%02d",ch,&h1,&m1,&s1,&h2,&m2,&s2);
            t1 = h1*3600+m1*60+s1;
            t2 = h2*3600+m2*60+s2;
            string str(ch);
            Record r(str,t1,t2);
            records.push_back(r);
        }
        sort(records.begin(),records.end(),cmp1);
        first = records[0].id;
        sort(records.begin(),records.end(),cmp2);
        last = records[0].id;
        cout<<first<<" "<<last<<endl;
    }

    return 0;
}