PAT (Advanced Level) 甲级 1006 Sign In and Sign Out

---

点此查看所有题目集

---

At the beginning of every day, the first person who signs in the computer room will unlock the door, and the last one who signs out will lock the door. Given the records of signing in's and out's, you are supposed to find the ones who have unlocked and locked the door on that day.

 

Input Specification:

Each input file contains one test case. Each case contains the records for one day. The case starts with a positive integer M, which is the total number of records, followed by M lines, each in the format:

ID_number Sign_in_time Sign_out_time

where times are given in the format HH:MM:SS, and ID_number is a string with no more than 15 characters.

 

Output Specification:

For each test case, output in one line the ID numbers of the persons who have unlocked and locked the door on that day. The two ID numbers must be separated by one space.

Note: It is guaranteed that the records are consistent. That is, the sign in time must be earlier than the sign out time for each person, and there are no two persons sign in or out at the same moment.

 

 简单的结构体排序，算出最早的那个时间和最晚的那个时间。刚开始想的是将所有的时间存储下来，然后排序找到首尾，但是后来发现完全没必要，那样只会徒增时间复杂度和空间复杂度。

#include <bits/stdc++.h>
using namespace std;
typedef struct so
{
    string no;
    int h,m,s;
};
//本题关键应该在于每个的比较 而不是存储后排序 因为需要的数据就首尾
bool is(so a,so b)//比较时间的函数 true 为早
{
    if (a.h!=b.h) return a.h<b.h;
    else if (a.m!=b.m) return a.m<b.m;
    else return a.s<b.s;
}

int main()
{
    int M;cin >> M;
    so ear,lat;
    for(int i = 0;i<M;i++)
    {
        so t;
        cin >> t.no;
        scanf("%d:%d:%d",&t.h,&t.m,&t.s);
        if (i==0) ear = t;
        else {
            if (is(t,ear)) ear = t;
        }
        scanf("%d:%d:%d",&t.h,&t.m,&t.s);
        if (i==0) lat = t;
        else{
            if(is(lat,t)) lat = t;
        }
        
    }
    cout << ear.no <<" " <<lat.no;
    return 0;
}