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
#include <stdlib.h>
#include <iostream>
using namespace std;
/*
* 题目大意为:输入n组数,每组包括一个开始时间与结束时间;
* 找出最早的开始时间所对应的那个数与最迟的结束时间所对应的数
*/
int main() {
int n,h1,m1,s1,h2,m2,s2,a[100001],b[100001];
string s,c[16];
scanf("%d",&n);
for(int i=0;i<n;i++){
cin>>s;
c[i]=s;//将字符串存在c数组中
scanf("%d:%d:%d",&h1,&m1,&s1);
scanf("%d:%d:%d",&h2,&m2,&s2);
a[i]=h1*3600+m1*60+s1;//判断时间早晚
b[i]=h2*3600+m2*60+s2;
}
int sum1=a[0],sum2=b[0];//默认第一组数符合条件,进行比较,找出最终的结果
string c1=c[0],c2=c[0];
for(int i=1;i<n;i++){
if(sum1>a[i]){//找出最早时间
sum1=a[i];
c1=c[i];
}
if(sum2<b[i]){//找出最迟时间
sum2=b[i];
c2=c[i];
}
}
cout<<c1<<' '<<c2<<endl;
return 0;
}