PAT 甲级- 1006 Sign In and Sign Out

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

题目大意及解题思路

首先输入一个int类型M，然后依次输入M个人的信息包括 编号，到的时间和离开时间。让你根据这些信息来输出最先到的人编号和最晚离开人的编号。  可以使用结构体保存每个人的信息，然后比较，但是题中要求的仅是最先到的人编号和最晚到的人编号，所以也可以直接用一次遍历来完成，采用string类型来存储，string类型的好处是可以直接比较大小和相等，以及直接赋值。

实现代码

#include<iostream>
#include<string>
using namespace std;

int main()
{
	int m;
	cin>>m;
	string str_fir_time="999",str_last_time="000",ans1,ans2;
	for(int i=0;i<m;i++)
	{
		string str1,str2,str3;
		cin>>str1>>str2>>str3;
		if(str2<str_fir_time)
		{
			str_fir_time = str2;
			ans1 = str1;
		}
		if(str3>str_last_time)
		{
			str_last_time = str3;
			ans2 = str1;
		}
	}
	cout<<ans1<<" "<<ans2;
	
	return 0;
 }