题目
1006 Sign In and Sign Out (25 分)
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
题目意思
就是有n个人,每个人的学号和进来的时间和出去的时间。现在要找到开锁和关锁的人,并输出学号。
思路,开锁的人一定是来的最早的人,关锁的一定是最晚走的人,排个序就能解决啦。为了避免有可能有个人又是最早的又是最晚的,所以排两次序。
代码
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
using namespace std;
struct hx{
char a[18];
char start[10];
char End[10];
};
bool cmp(hx a,hx b)
{
if(strcmp(a.start,b.start)>0)
return false;
else
return true;
}
bool cmp1(hx a,hx b)
{
if(strcmp(a.End,b.End)<0)
return false;
else
return true;
}
int main()
{
int n;
scanf("%d",&n);
hx mz[103];
for(int i=0;i<n;i++)
{
scanf("%s%s%s",mz[i].a,mz[i].start,mz[i].End);
}
sort(mz,mz+n,cmp);
printf("%s",mz[0].a);
sort(mz,mz+n,cmp1);
printf(" %s\n",mz[0].a);
return 0;
}