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
编译软件:visual studio
编译语言:c语言
参考代码:
#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
struct pNode {
char id[20];
int hh, mm, ss;
}temp, ans1, ans2;
bool great(pNode node1, pNode node2)
{
if (node1.hh != node2.hh) return node1.hh > node2.hh;
else if (node1.mm != node2.mm) return node1.mm > node2.mm;
else return node1.ss > node2.ss;
}
int main()
{
int n;
scanf_s("%d", &n);
ans1.hh = 24, ans1.mm = 60, ans1.ss = 60;
ans2.hh = 0, ans2.mm = 0, ans2.ss = 0;
for (int i = 0; i < n; i++)
{
scanf_s("%s %d:%d:%d", temp.id, &temp.hh, &temp.mm, &temp.ss);
if (great(temp, ans1) == false) ans1 = temp;
scanf_s("%d:%d:%d", &temp.hh, &temp.mm, &temp.ss);
if (great(temp, ans2) == true) ans2 = temp;
}
printf("%s %s\n", ans1.id, ans2.id);
return 0;
}