PAT甲级真题及训练集(8)--1006. Sign In and Sign Out (25)
来源:互联网 发布:linux 端口扫描工具 编辑:程序博客网 时间:2024/06/15 19:52
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
提交代码
/**作者:一叶扁舟时间:23:46 2017/6/18思路:*/#include <stdio.h>#include <stdlib.h>#include <string.h>#include <algorithm>using namespace std;#define SIZE 100001typedef struct WorkTime{char id[20];//员工的idchar startTime[10];//上班时间char endTime[10];//下班时间}WorkTime;int main(){int N;char id[15], firstTime[10], endTime[10];int firstNum;//上班最早的员工坐标int endNum; //下班最晚的员工坐标WorkTime workTime[SIZE];char maxTime[10] = "23:59:59";char minTime[10] = "00:00:00";scanf("%d", &N);for (int i = 0; i < N; i++){scanf("%s %s %s", id, firstTime, endTime);strcpy(workTime[i].id, id);strcpy(workTime[i].startTime ,firstTime);strcpy(workTime[i].endTime , endTime);if (strcmp(firstTime, maxTime) <= 0){//比较上班时间,找到最早上班的人strcpy(maxTime,firstTime);firstNum = i;}if (strcmp(endTime, minTime) >= 0){//找到最晚下班的人strcpy(minTime, endTime);endNum = i;}}printf("%s %s", workTime[firstNum].id, workTime[endNum].id);system("pause");return 0;}
- PAT甲级真题及训练集(8)--1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25)-PAT甲级真题
- PAT - 甲级 - 1006. Sign In and Sign Out (25
- PAT甲级.1006. Sign In and Sign Out (25)
- 1006. Sign In and Sign Out (25) PAT 甲级
- 【PAT甲级】1006. Sign In and Sign Out (25)
- 【PAT甲级】【C++】1006. Sign In and Sign Out (25)
- PAT TEST甲级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 (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. Sign In and Sign Out
- [PAT-甲级]1006.Sign In and Sign Out
- c++中map与unordered_map的区别
- 为Notepad++配置MinGW的C++编译器
- 分布式系统,计算,hadoop等方面的论文
- JSON数组形式字符串转换为Map数组(转为其他的Bean的话,请参考自行变形)
- WPF控件之Expander
- PAT甲级真题及训练集(8)--1006. Sign In and Sign Out (25)
- Dynamic Linq Query 简单API
- 连接mysql提示com.mchange.v2.resourcepool.BasicResourcePool
- android studio导入外部项目的报错收集
- Go语言中字符串的拼装方法
- 暂存
- Java初始化顺序总结及其程序执行过程图- 静态变量、静态代码块、成员变量、构造函数
- KVO的实现原理与具体应用
- Android 性能优化(二)