【PAT甲】1006 Sign In and Sign Out (25分)循环模拟

problem

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

• 给出n个人的id和登录登出时间
• 求最早进来和最早出去的人的ID

solution

• 将时间都转为总秒数，输入的时候更新即可

#include<iostream>
#include<string>
using namespace std;
int main(){
	int n;  cin>>n;
	int zaojin=9999999,zaochu=0;
	string jin, chu;
	for(int i = 1; i <= n; i++){
		string s; cin>>s;
		int h1, m1, s1, h2, m2, s2;
		scanf("%d:%d:%d",&h1,&m1,&s1);
		scanf("%d:%d:%d",&h2,&m2,&s2);
		int t1 = h1*3600+m1*60+s1;
		int t2 = h2*3600+m2*60+s2;
		if(t1<zaojin){
			zaojin = t1;
			jin = s;
		}
		if(t2>zaochu){
			zaochu = t2;
			chu = s;
		}
	}
	cout<<jin<<" "<<chu;
	return 0;
}



  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
  
19
  
20
  
21
  
22
  
23
  
24
  
25
  
26
  
27
  
28
 

文章来源: gwj1314.blog.csdn.net，作者：小哈里，版权归原作者所有，如需转载，请联系作者。

原文链接：gwj1314.blog.csdn.net/article/details/108411069