PAT甲级练习题-Sign In and Sign Out (25)

最新推荐文章于 2022-10-29 11:38:16 发布

lyyy.

最新推荐文章于 2022-10-29 11:38:16 发布

阅读量246

点赞数

分类专栏： PAT甲级练习题文章标签： PAT甲级

本文链接：https://blog.csdn.net/ly59782/article/details/79988959

版权

PAT甲级练习题专栏收录该内容

19 篇文章 0 订阅

订阅专栏

本篇博客介绍了一个简单的问题解决方案：如何通过输入一组人员的到达时间和离开时间记录，找出当天最早到达及最晚离开的人。文章提供了一段C++代码实现，通过将时间转换为秒数进行比较，从而确定最早和最晚的时间记录。

摘要由CSDN通过智能技术生成

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

/**
题意：
n个人，每个人来和走的时间，问第一个来的和最后一个走的分别是谁
题解：
换算成秒，找最小和最大
*/

#include <cstdio>
#include <cassert>
#include <iostream>
#include <queue>
#include <algorithm>

using namespace std;

const int INF = 0x3f3f3f3f;
const int maxn = 10000 + 5;

struct node{
    int come,go;
    string id;
}peo[maxn];


int main() {
    int n,h,m,s;
    string id;
    cin>>n;
    int early = INF,late = 0;
    int en= -1,ln = -1;
    for(int i = 0;i<n;++i){
        cin>>id;
        scanf("%d:%d:%d",&h,&m,&s);
        peo[i].id = id;
        peo[i].come = h*3600+m*60+s;
        if(early > peo[i].come){
            early = peo[i].come;
            en = i;
        }
        scanf("%d:%d:%d",&h,&m,&s);
        peo[i].go = h*3600+m*60+s;
        if(late < peo[i].go){
            late = peo[i].go;
            ln = i;
        }
    }
    cout<<peo[en].id<<" "<<peo[ln].id;





    return 0;
}