(PAT)1007. Maximum Subsequence Sum

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
class   Student
{
public:
    string sid;
    int checkin;
    int checkout;
    Student(string id,int m_checkin,int m_checkout):sid(id),checkin(m_checkin),checkout(m_checkout)
    {}

};
bool isEarly(const Student &stu1,const Student &stu2)
{
    return stu1.checkin<=stu2.checkin;
}
bool isLate(const Student &stu1,const Student &stu2)
{
    return stu1.checkout>=stu2.checkout;
}
int main()
{
    int n;
    vector<Student> vec;
    cin>>n;
    for(int i=0;i<n;i++)
    {
        string s;
        int i_hour;
        int i_min;
        int i_second;
        int i_sum=0;
        int o_hour;
        int o_min;
        int o_second;
        int o_sum=0;
        char c;
        cin>>s>>i_hour>>c>>i_min>>c>>i_second>>o_hour>>c>>o_min>>c>>o_second;
       // cout<<s<<" "<<i_hour<<" "<<i_min<<" "<<i_second<<" "<<o_hour<<" "<<o_min<<" "<<o_second<<endl;
        i_sum=i_hour*60*60+i_min*60+i_second;
        if(o_hour==0)o_hour=24;
        o_sum=o_hour*60*60+o_min*60+o_second;
        Student stu(s,i_sum,o_sum);
        vec.push_back(stu);
    }
    sort(vec.begin(),vec.end(),isEarly);
    cout<<vec[0].sid;
    sort(vec.begin(),vec.end(),isLate);
    cout<<" "<<vec[0].sid;
}