本文主要是介绍【PAT】【Advanced Level】1006. Sign In and Sign Out (25),希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!
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:40Sample Output:
SC3021234 CS301133
原题链接:
https://www.patest.cn/contests/pat-a-practise/1006
思路:
边输入边比较
CODE:
#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;int main()
{int m;cin>>m;string mz="24:00:00";string mw="00:00:00";string nm1;string nm2;for (int i=0;i<m;i++){string a,b,c;cin>>a>>b>>c;if (b<=mz){mz=b;nm1=a;}if (c>=mw){mw=c;nm2=a;}}cout<<nm1<<" "<<nm2;return 0;
}
这篇关于【PAT】【Advanced Level】1006. Sign In and Sign Out (25)的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!