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

题目描述

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.

输入

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.

输出

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.

思路

其实很简单，求最大最小值的问题，时间表示是本题的关键。可以发现hh:mm::ss=hh3600+mm60+ss(s)，全部以s进行变换，之后存下最大值最小值即可。

代码

#include<iostream>
#include<cstdio>
#include<string.h>
#include<stdlib.h>
using namespace std;
char yd[10000][10] = { 0 };
int maxx = 0, minn = 90000;
int s_id, e_id;
int main()
{
    int n;
    scanf("%d", &n);
    getchar();
    for (int i = 0; i < n; i++)
    {
        char str[100];
        cin.getline(str, 100);
        int s_h, s_m, s_s;
        int e_h, e_m, e_s;
        int s, e;
        sscanf(str, "%s %d:%d:%d %d:%d:%d", yd[i], &s_h, &s_m, &s_s, &e_h, &e_m, &e_s);
        s = s_h * 3600 + s_m * 60 + s_s;
        e = e_h * 3600 + e_m * 60 + e_s;
        if (s < minn)
        {
            minn = s;
            s_id = i;
        }
        if (e > maxx)
        {
            maxx = e;
            e_id = i;
        }
    }
    printf("%s %s\n", yd[s_id], yd[e_id]);
    return 0;
}