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

---

解题思路 ：

在输入数据过程中，比较各学生的进入和离开时间，找到最早和最晚时间的学生下标

 

类构建：

class student
{
public:
	string name;
	string start;
	string end;

	student() :name(""), start(""), end("") {};
};

读数据时开辟一个数组来存放就ok

比较函数：

int compare(string a, string b)
{
	int len = a.length();

	for (int i = 0; i < len; i++)
	{
		if (a[i] != b[i])
		{
			return a[i] - b[i];
		}
	}

	return 0;
}

返回值大于0就是更晚，等于0就是相等，小于0就是更早；

还要定义MAX和MIN来每次记录数据读取的最早和最晚值

string Max = "00:00:00";
string Min = "23:59:59";

定义MAX要定义为最早时间方便初始化，MIN同理

 

---

代码：

#include <bits/stdc++.h>
using namespace std;

string Max = "00:00:00";
string Min = "23:59:59";

class student
{
public:
	string name;
	string start;
	string end;

	student() :name(""), start(""), end("") {};
};

int compare(string a, string b)
{
	int len = a.length();

	for (int i = 0; i < len; i++)
	{
		if (a[i] != b[i])
		{
			return a[i] - b[i];
		}
	}

	return 0;
}

int main()
{
	int n;
	cin >> n;

	int early = 0, late = 0;

	student* arr = new student[n];

	for (int i = 0; i < n; i++)
	{
		string a, b, c;
		cin >> a >> b >> c;

		arr[i].name = a;
		arr[i].start = b;
		arr[i].end = c;

		if (compare(b, Min) <= 0)
		{
			early = i;
			Min = b;
		}

		if (compare(c, Max) >= 0)
		{
			late = i;
			Max = c;
		}
	}

	cout << arr[early].name << " " << arr[late].name;

	return 0;
}

---

结果截图：