A1006 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
Code
结构体问题,回忆一下结构体排序:
//从小到大排序
bool cmp(person a, person b)
{
return a.in<b.in; // "<" → 从小到大排序
}
//从大到小排序
bool cmp(person a, person b)
{
return a.in>b.in; // ">" → 从大到小排序
}
//有相等项
bool cmp(person a, person b)
{
if(a.in != b.in)
return a.in<b.in;
else
return a.out>b.out; //in相等,则按out从大到小排,序
}
sort(首元素地址,尾元素地址的下一个地址,排序函数(可以没有));
//sort(p,p+n,cmp);
#include<bits/stdc++.h>
using namespace std;
struct person
{
string id;
int in,out;
}p[1010];
bool cmp(person a, person b)
{
return a.in<b.in;
}
bool cmp1(person a, person b)
{
return a.out>b.out;
}
int main()
{
int n;
cin>>n;
string s;
int h1,m1,second1,h2,m2,second2;
for(int i=0;i<n;i++)
{
cin>>s;
scanf("%d:%d:%d %d:%d:%d",&h1,&m1,&second1,&h2,&m2,&second2);
p[i].id = s;
p[i].in = h1*60*60 + m1*60 + second1;
p[i].out = h2*60*60 + m2*60 + second2;
}
sort(p,p+n,cmp);
cout<<p[0].id<<" ";
sort(p,p+n,cmp1);
cout<<p[0].id;
}