1006. Sign In and Sign Out (25)
2016-02-10 22:20
239 查看
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 lockedthe 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_timewhere 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
#include <iostream>#include <vector>#include <stdio.h>#include <string>#include <algorithm>using namespace std;typedef pair<int, int> times;typedef pair<string,times> personCase;int cmp1(personCase,personCase);int cmp2(personCase,personCase);int main(){vector<personCase>total;int M;cin>>M;while (M--) {string ID,startTime,endTime;cin>>ID>>startTime>>endTime;int hh,mm,ss,start,end;sscanf(startTime.c_str(), "%d:%d:%d",&hh,&mm,&ss);start=hh*3600+mm*60+ss;sscanf(endTime.c_str(), "%d:%d:%d",&hh,&mm,&ss);end=hh*3600+mm*60+ss;times time11(start,end);personCase p(ID,time11);total.push_back(p);}sort(total.begin(), total.end(), cmp1);cout<<total[0].first<<" ";sort(total.begin(), total.end(), cmp2);cout<<total[0].first<<endl;return 0;}int cmp1(personCase a,personCase b){return a.second.first<b.second.first;}int cmp2(personCase a,personCase b){return a.second.second>b.second.second;}
相关文章推荐
- markdown你的生活 | markdown编辑器简介
- BZOJ 2243 染色 [树链剖分]
- 1005. Spell It Right (20)
- 【HDOJ】4328 Cut the cake
- 当phantomJS遇上Requests
- 文件系统管理
- 优先级队列——PriorityQueue
- 1004. Counting Leaves (30)
- 磁盘管理
- PyMySQL与Django的结合
- 队列单向
- 1003. Emergency (25)
- HDU 3853 LOOPS 概率DP 期望
- 机械键盘科普知识
- 1002. A+B for Polynomials (25)
- JavaScript创建对象之稳妥构造函数模式(七)
- 待解决
- 1001. A+B Format (20)
- [LeetCode]53. Maximum Subarray
- android 中的Uri详解