PAT甲级——A1006 Sign In and Sign Out
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
很简单。。。。
1 #include <iostream> 2 #include <string> 3 4 using namespace std; 5 6 7 //很简单,就是找到来的最早的人和回去最晚的人即可 8 int getTime(string Time) 9 { 10 //由于时间时标准输入,所以很好计算 11 return ((Time[0] - '0') * 10 + (Time[1] - '0')) * 60 * 60 + 12 ((Time[3] - '0') * 10 + (Time[4] - '0')) * 60 + 13 (Time[6] - '0') * 10 + (Time[7] - '0'); 14 15 } 16 17 int main() 18 { 19 int M; 20 cin >> M; 21 string firstMan, lastMan; 22 int firstTime, lastTime; 23 firstTime = 24 * 60*60 + 1;//24小时多一秒,属于第二天了 24 lastTime = -1;//属于前一天 25 string No, InTime, OutTime; 26 for (int i = 0; i < M; ++i) 27 { 28 cin >> No >> InTime >> OutTime; 29 if (firstTime > getTime(InTime)) 30 { 31 firstTime = getTime(InTime); 32 firstMan = No; 33 } 34 if (lastTime < getTime(OutTime)) 35 { 36 lastTime = getTime(OutTime); 37 lastMan = No; 38 } 39 } 40 cout << firstMan << " " << lastMan << endl; 41 return 0; 42 }
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步