PTA-1006 Sign In and Sign Out (25 分)

最新推荐文章于 2021-07-05 22:38:00 发布

少女情怀总是诗mmm

最新推荐文章于 2021-07-05 22:38:00 发布

阅读量218

点赞数

分类专栏： PTA甲级

本文链接：https://blog.csdn.net/qiulianshaonv_wjm/article/details/95627703

版权

PTA甲级专栏收录该内容

13 篇文章

订阅专栏

该博客介绍了一道编程题目，要求根据输入的签到和签退记录，确定每天解锁和锁定计算机室门的人员ID。输入包含签到和签退的时间及ID，输出为最早签到和最晚签退的人员ID。题目保证了记录的逻辑一致性，不会出现同一时刻多人签到或签退的情况。

摘要由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

题意：输出最早来和最晚走的人的编号

解析：将时间都转化为秒的形式，用结构体数组排一下序。

#include<iostream>
#include<cstring>
#include<string.h>
#include<stdio.h>
#include<algorithm>
using namespace std;
#define maxn 100005
struct node
{
    string name;
    int start;
    int ends;
}s[maxn];
int cmp1(struct node x,struct node y)
{
    return x.start < y.start;
}
int cmp2(struct node x,struct node y)
{
    return x.ends > y.ends;
}
int main()
{
    int t;
    scanf("%d",&t);
    for(int i = 0; i < t; i ++)
    {
        string temp;
        cin>>temp;
        s[i].name = temp;
        int a,b,c;
        scanf("%d:%d:%d",&a,&b,&c);
        int k = a*3600+b*60+c;
        s[i].start = k;
        scanf("%d:%d:%d",&a,&b,&c);
        k = a*3600+b*60+c;
        s[i].ends = k;
    }
    sort(s,s+t,cmp1);
    cout<<s[0].name;
    cout<<" ";
    sort(s,s+t,cmp2);
    cout<<s[0].name;
    return 0;
}