浙大PAT甲级1006
2016-10-15 21:29
330 查看
1006. Sign In and Sign Out (25)
时间限制400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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<stdio.h> struct{ char a[16]; int in,out; }id[1000000]; int main(){ int m; scanf("%d",&m); int i,in1,in2,in3,out1,out2,out3; for(i=0;i<m;i++){ scanf("%s %d:%d:%d %d:%d:%d",id[i].a,&in1,&in2,&in3,&out1,&out2,&out3); id[i].in=in1*10000+in2*100+in3; id[i].out=out1*10000+out2*100+out3; } int small,big,si=0,bi=0; small=id[0].in; big=id[0].out; for(i=1;i<m;i++){ if(id[i].in<small){ small=id[i].in; si=i; } if(id[i].out>big){ big=id[i].out; bi=i; } } printf("%s %s",id[si].a,id[bi].a); return 0; }
相关文章推荐
- 浙大PAT甲级-1006
- 浙大pat | 浙大pat 牛客网甲级 1006 Cars on Campus (30)多区域覆盖题
- 浙大Pat | 浙大pat 牛客网甲级 1003 Highest Price in Supply Chain (25)DFS
- 浙大pat | 牛客网甲级 1045 Hello World for U (20) 字符串
- 浙大PAT甲级 1031
- 浙大PAT甲级 1040
- 浙大PAT甲级 1063
- *浙大PAT甲级 1067
- *浙大PAT甲级 1087 dijkstra+dfs
- 浙大PAT甲级 1097
- 浙大PAT甲级 1104
- 【C++】浙大PAT (Basic Level)1006. 换个格式输出整数 (15)
- [PAT-甲级]1006.Sign In and Sign Out
- 浙大 PAT Advanced level 1006. Sign In and Sign Out
- 浙大PAT甲级 1032
- 浙大PAT甲级 1038
- 浙大PAT甲级 1053
- ** 浙大PAT甲级 1068 01背包问题
- *浙大PAT甲级 1079
- **浙大PAT甲级 1093 树状数组