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

---

题解：

利用自定义的 sort 函数即可求解；

---

注意事项：

此处应另外注意的是 scanf 关于 string 类型的输入会产生段错误，建议使用char数组替代

---

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

struct person {
	char id[15];
	int in_hour, in_min, in_sec;
	int out_hour, out_min, out_sec;
};

bool cmp_in(person p1, person p2) {
	if (p1.in_hour == p2.in_hour) 
		if (p1.in_min == p2.in_min) 
			return p1.in_sec < p2.in_sec;
		else
			return p1.in_min < p2.in_min;
	else
		return p1.in_hour < p2.in_hour;
}

bool cmp_out(person p1, person p2) {
	if (p1.out_hour == p2.out_hour)
		if (p1.out_min == p2.out_min)
			return p1.out_sec > p2.out_sec;
		else
			return p1.out_min > p2.out_min;
	else
		return p1.out_hour > p2.out_hour;
}

int main()
{
	int M;
	scanf("%d", &M);
	person p[100];
	for (int i = 0; i < M; i++) {
		scanf("%s", p[i].id);
		scanf("%d:%d:%d", &p[i].in_hour, &p[i].in_min, &p[i].in_sec);
		scanf("%d:%d:%d", &p[i].out_hour, &p[i].out_min, &p[i].out_sec);
	}
	sort(p, p + M, cmp_in);
	printf("%s ", p[0].id);
	sort(p, p + M, cmp_out);
	printf("%s", p[0].id);
}