pat 1006 Sign In and Sign Out
2014-10-24 10:01
357 查看
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:
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:
Sample Output:
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 <stdio.h> #include <stdlib.h> #include <cstring> #include <vector> #include <algorithm> using namespace std; struct person { char id[16]; char in_time[10]; char out_time[10]; }; bool cmp_in(person p1,person p2)//sort in increasing order { int re=strcmp(p1.in_time,p2.in_time); if(re>=0) return false; else return true; //return p1.in_time<p2.out_time; } bool cmp_out(person p1,person p2)//sort in decreasign order { int re=strcmp(p1.out_time,p2.out_time); if(re>=0) return true; else return false; } int main() { //freopen("F:/CppProject/data/1006.txt","r",stdin); int m; vector<person> seq; scanf("%d",&m); for(int i=0;i<m;i++) { char id_tmp[16],in_time_tmp[10],out_time_tmp[10]; scanf("%s%s%s",&id_tmp,&in_time_tmp,&out_time_tmp); //printf("%s%s%s\n",id_tmp,in_time_tmp,out_time_tmp); person p; strcpy(p.id,id_tmp); strcpy(p.in_time,in_time_tmp); strcpy(p.out_time,out_time_tmp); //printf("%s %s %s \n",p.id,p.in_time,p.out_time); seq.push_back(p); } sort(seq.begin(),seq.end(),cmp_in); //for(int i=0;i<seq.size();i++) //printf("%s %s %s \n",seq[i].id,seq[i].in_time,seq[i].out_time); printf("%s ",seq[0].id); //printf("\n\n"); sort(seq.begin(),seq.end(),&cmp_out); //for(int i=0;i<seq.size();i++) //printf("%s %s %s \n",seq[i].id,seq[i].in_time,seq[i].out_time); printf("%s\n",seq[0].id); return 0; }
相关文章推荐
- PAT_1006: Sign In and Sign Out
- pat1006 Sign In and Sign Out
- PAT 1006. Sign In and Sign Out
- PAT 1006 Sign In and Sign Out
- 【PAT (Advanced Level)】1006. Sign In and Sign Out (25)
- 浙江大学PAT上机题解析之1006. Sign In and Sign Out (25)
- pat 1006. Sign In and Sign Out (25)
- [PAT]1006. Sign In and Sign Out (25)
- PAT 1006 Sign In and Sign Out
- 浙大PAT 1006题 1006. Sign In and Sign Out
- 【PAT Advanced Level】1006. Sign In and Sign Out (25)
- PAT_ADVANCED LEVEL 1006 Sign In and Sign Out (25) 排序
- Pat(Advanced Level)Practice--1006(Sign In and Sign Out)
- PAT 1006. Sign In and Sign Out (25)
- 【PAT Advanced Level】1006. Sign In and Sign Out (25)
- 【c++】PAT (Advanced Level) 1006. Sign In and Sign Out (25)
- PAT 1006. Sign In and Sign Out (25)
- PAT 1006. Sign In and Sign Out (25)
- ZJU PAT 1006 Sign In and Sign Out
- PAT 1006. Sign In and Sign Out