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
结尾无空行
很简单的一个题,感觉像是 20 分的难度,直接定义结构体存放用户信息,再一次遍历即可求出最早到达以及最晚到达的人,输出即可,注意 string 自带的 大小于号可以自动按照字典序排序,所以很方便。
#include<iostream>
#include<string>
#include<algorithm>
#include<bits/stdc++.h>
#include<stack>
#include<set>
#include<vector>
#include<map>
#include<queue>
#include<deque>
#include<cctype>
#include<unordered_set>
#include<unordered_map>
#include<fstream>
#include<cstring>
using namespace std;
struct Node {
string id;
string start;
string end;
}a[10001];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i].id >> a[i].start >> a[i].end;
}
string start = a[0].start;
string end = a[0].end;
string id_start = a[0].id, id_end = a[0].id;
for (int i = 1; i < n; i++) {
if (a[i].start < start) {
start = a[i].start;
id_start = a[i].id;
}
if (a[i].end > end) {
end = a[i].end;
id_end = a[i].id;
}
}
cout << id_start << " " << id_end;
return 0;
}