1006 Sign In and Sign Out

最新推荐文章于 2022-01-23 19:33:52 发布

原创最新推荐文章于 2022-01-23 19:33:52 发布 · 229 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#PAT (Advanced Level) Practice

PTA 专栏收录该内容

25 篇文章

订阅专栏

本篇博客介绍了一个关于记录计算机房人员签到与签退的时间问题，并通过编程解决找出当天第一个签到（解锁门）和最后一个签退（锁门）的人。输入包括总记录数及每个人的ID和时间，输出则是解锁和锁门人的ID。

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.

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 <bits/stdc++.h>
using namespace std;
int main()
{
	int n;
	string in,out;
	cin>>n;
	int MAX=-1,MIN=100000;
	while(n--)
	{
		string s;
		int h1,m1,s1,h2,m2,s2;
		cin>>s;
		scanf("%d:%d:%d %d:%d:%d",&h1,&m1,&s1,&h2,&m2,&s2);
		int sum1=h1*3600+m1*60+s1;
		int sum2=h2*3600+m2*60+s2;
		if(sum1<MIN)
		{
			MIN=sum1;
			in=s;
		}
		if(sum2>MAX)
		{
			MAX=sum2;
			out=s;
		}
	}
	cout<<in<<" "<<out;
	return 0;
}