A1006. 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

题目大意：

记录每天第一个到机房的人和最后一个到机房的人，输入的数据格式为m（代表m行数据），之后的数据格式为姓名；签到时间；离开时间。

思路：

用结构体存入姓名和时间；定义结构体temp，early，last; temp用于读入数据，early记录最早签到，last记录最晚时间。

先对early和last初始化，之后读入数据之后，再不断更新；写一个比较函数compare，比较时间前后；

代码如下：

#include <cstdio>

struct person{
	char id[20];
	int hh, mm, ss;
}temp, early, last;

bool compare (person a, person b) {					    //定义函数用于判断时间先后； 
	if (a.hh != b.hh)		return a.hh > b.hh;
	else if (a.mm != b.mm)		return a.mm > b.mm;                  //可以不用else; return后不会执行下面语句；   
		else return a.ss > b.ss;    
}

void init() {
	early.hh = 24, early.mm = early.ss = 60;			//对early和last初始化； 
	last.hh = last.mm = last.ss = 0;
}

int main()
{
	init();
	int m;
	scanf ("%d", &m);
	for (int i = 0; i < m; i++) {
		scanf ("%s %d:%d:%d", temp.id, &temp.hh, &temp.mm, &temp.ss);
		if (compare (temp, early) == false)		early = temp;			//对最早时间更新； 
		scanf ("%d:%d:%d", &temp.hh, &temp.mm, &temp.ss);	
		if (compare (temp, last) == true)		last = temp;			//id上一步已读入； 
	}
	
	printf ("%s %s\n", early.id, last.id);

 	return 0;
}