pat 1006

主要是读取和判断时间大小，其他逻辑没啥问题，贴代码

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>

using namespace std;

struct timer {
    int h, m, s;
    timer(int _h,int _m,int _s):h(_h),m(_m),s(_s){}
};
bool operator<(const timer& lhs, const timer& rhs)
{
    return lhs.h < rhs.h ||
        !(rhs.h < lhs.h) && lhs.m < rhs.m ||//注意在小时相等的情况下比较分钟
                //注意在小时和分钟相等的情况下比较秒
        !(rhs.h < lhs.h) && !(rhs.m < lhs.m) && lhs.s < rhs.s;
}
struct student {
    string id;
    timer time_in, time_out;
    student(const string& _id,const timer& i,const timer& o):
        id(_id),time_in(i),time_out(o){}
};

vector<student> vs;
bool less_f(const student& lhs, const student& rhs)
{
    return lhs.time_in < rhs.time_in;
}

bool bigger_f(const student& lhs, const student& rhs)
{
    return rhs.time_out < lhs.time_out;
}

int main(void)
{
    int n;
    cin >> n;
    for (int i = 0;i < n;i++)
    {
        string id;
        int h1, m1, s1, h2, m2, s2;
        cin >> id;
        scanf("%d%*c%d%*c%d", &h1, &m1, &s1);
        scanf("%d%*c%d%*c%d", &h2, &m2, &s2);
        vs.push_back(student(id,
            timer(h1, m1, s1), timer(h2, m2, s2)));    
    }
    sort(vs.begin(), vs.end(), less_f);
    cout << vs[0].id << " ";
    sort(vs.begin(), vs.end(), bigger_f);
    cout << vs[0].id << endl;

    return 0;

}