【PAT (Advanced Level)】1006. Sign In and Sign Out (25)
来源:互联网 发布:金融数据终端 编辑:程序博客网 时间:2024/05/20 00:17
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:3CS301111 15:30:28 17:00:10SC3021234 08:00:00 11:25:25CS301133 21:45:00 21:58:40Sample Output:
SC3021234 CS301133
简单题,输入时间,比较一下排序就可以了;
代码:/************************************This is a test program for anythingEnjoy IT!************************************/#include <iostream>#include <iomanip>#include <algorithm>#include <vector>#include <list>#include <set>#include <fstream>#include <string>#include <cmath>using namespace std;struct Student{string ID;string sign_in;string sign_out;Student(string id, string in, string out): ID(id), sign_in(in), sign_out(out){}};bool inComp(const Student &l, const Student &r){for (int i = 0; i < 9; i++){if (l.sign_in[i] == r.sign_in[i]) continue;return l.sign_in[i] < r.sign_in[i];}}bool outComp(const Student &l, const Student &r){for (int i = 0; i < 9; i++){if (l.sign_out[i] == r.sign_out[i]) continue;return l.sign_out[i] > r.sign_out[i];}}int main(){ifstream cin;cin.open("in.txt");ofstream cout;cout.open("out.txt");//////////////////////////////////////////////////////////////////////////// TO DO Whatever You WANT!int n;while (cin >> n){vector<Student> vS;for (int i = 0; i < n; i++){string id, in, out;cin >> id >> in >> out;Student st(id, in, out);vS.push_back(st);}sort(vS.begin(), vS.end(), inComp);cout << vS.front().ID << " ";sort(vS.begin(), vS.end(), outComp);cout << vS.front().ID << endl;}//////////////////////////////////////////////////////////////////////////// system("pause");return 0;}
- 【PAT Advanced Level】1006. Sign In and Sign Out (25)
- 【PAT (Advanced Level)】1006. Sign In and Sign Out (25)
- 【PAT】【Advanced Level】1006. Sign In and Sign Out (25)
- PAT(Advanced level) 1006. Sign In and Sign Out
- 浙大 PAT Advanced level 1006. Sign In and Sign Out
- PAT (Advanced) 1006. Sign In and Sign Out (25)
- 【c++】PAT (Advanced Level) 1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)——PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1006. Sign In and Sign Out (25)
- PAT (Advanced Level) 1006. Sign In and Sign Out (25) 字符串比较
- PAT (Advanced Level) 1006. Sign In and Sign Out (25) 解题报告
- PAT (Advanced Level) Practise 1006. Sign In and Sign Out (25)
- PAT (Advanced Level) Practise 1006. Sign In and Sign Out (25)
- Pat(Advanced Level)Practice--1006(Sign In and Sign Out)
- PAT Advanced Level 1006:Sign In and Sign Out
- PAT(Advanced Level) 1006 - Sign In and Sign Out(水题)
- PAT (Advanced Level) Practise 1006 Sign In and Sign Out
- PAT-PAT (Advanced Level) Practise 1006. Sign In and Sign Out (25) (简单题)【一星级】
- 如何在Android平台上使用JS直接调用Java方法
- java 日期(Date DateFormat Calendar)
- ubuntu 中eclipse 无法找到系统标准头文件
- 工作日志
- js 得到某一天是星期几 和 得到某一天的前一天、后一天
- 【PAT (Advanced Level)】1006. Sign In and Sign Out (25)
- Virtio:针对 Linux 的 I/O 虚拟化框架
- http://blog.csdn.net/dm_vincent/article/details/7769159
- 将十进制数字转换为二十六进制字母串
- iOS开发-检测用户截屏, 并获取所截图片
- Java数据类型转换(简单类型、封装类型、String)
- 归并排序和逆序数
- cgi 编程的get和post
- 实体