pat 1006 Sign In and Sign Out (25)

題意：給id，這個id的入門時間，出門時間

找出最早進的id和最晚走的id

思路：沒輸入一組數據，直接進行比較。比較時間，接着更細時間與id。

 

 

#include<cstring>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<string>
using namespace std;
int main()
{
    string id, in_time, out_time, in_id, out_id;
    int n;
    cin>>n;
    cin>>id>>in_time>>out_time;
    in_id = out_id = id;
    for(int i = 1; i < n; i++)
    {
        string t1, t2, t3;
        cin>>t1>>t2>>t3;
        if(t2 < in_time)
        {
            in_time = t2;
            in_id = t1;
        }
        if(t3>out_time)
        {
            out_time = t3;
            out_id = t1;
        }
    }
    cout<<in_id<<" "<<out_id<<endl;
    return 0;
}