PTA 甲级 1006 Sign In and Sign Out (25 分)

题目

题目大意是：第一行给你M，表示有M个员工。

接着M行给你每个员工的工号，进门时间，出门时间。

第一个进门的人要解锁，最后一个出门的人要上锁。

求解锁和上锁的人的工号。

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.

Sample Input:

3
CS301111 15:30:28 17:00:10
SC3021234 08:00:00 11:25:25
CS301133 21:45:00 21:58:40

Sample Output:

SC3021234 CS301133

分析

是一个简单的结构体的排序问题，

按照时间排序。之前有一道题吃了时间排序的亏。2333其实题目规定好格式之后，只需要判断字符串的大小就行了。

字符串小的，时间靠前。

代码

using namespace std;
const int maxn = 100005;
struct People
{
    string id;
    string intime;
    string outtime;
}people[maxn];

bool incmp(People a , People b)
{
    return a.intime < b.intime;
}
bool outcmp(People a , People b)
{
    return a.outtime > b.outtime;
}

int main()
{
    int M;
    cin >> M;
    for(int i = 0 ; i < M ; i++)
    {
        cin >> people[i].id >> people[i].intime >> people[i].outtime;
    }
    sort(people , people + M , incmp);
    cout << people[0].id << " ";
    sort(people , people + M ,outcmp);
    cout << people[0].id;

}