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:40

Sample Output:

SC3021234 CS301133
题目分析：给定数据排序 ，直接利用vector对结构体排序 将比较函数重写就可以了
注意sort中比较函数 返回true是不交换的 鉴于现在我水平较低 之后会尝试分析 源码的(大概

 #include<iostream>
 #include<string>
 #include<stdlib.h>
 #include<vector>
 #include<algorithm>
 using namespace std;
 #define MaxNum 1
 typedef struct Node {
     string ID_numebr;
     string Sign_in_time;
     string Sign_out_time;
 }S;
 typedef struct Time {
     int H;
     int M;
     int S;
 }T;
 T t1, t2;
 int Atoi(string str, int i, int j)
 {
     int num = ;
     while (i<j)
     {
         num = num *  + str[i] - '';
         i++;
     }
     return num;
 }
 bool comp2(const S& a, const S& b)
 {

     t1.H = Atoi(a.Sign_out_time, , );
     t1.M = Atoi(a.Sign_out_time, , );
     t1.S = Atoi(a.Sign_out_time, , );
     t2.H = Atoi(b.Sign_out_time, , );
     t2.M = Atoi(b.Sign_out_time, , );
     t2.S = Atoi(b.Sign_out_time, , );
     if (t1.H > t2.H)
         return true;
     else if (t1.H == t2.H && t1.M > t2.M)
         return true;
     else if (t1.M == t2.M && t1.S > t2.S)
         return true;
     else
         return false;
 }

 bool comp1(const S& a, const S& b)
 {

     t1.H = Atoi(a.Sign_in_time, , );
     t1.M = Atoi(a.Sign_in_time, , );
     t1.S = Atoi(a.Sign_in_time, , );
     t2.H = Atoi(b.Sign_in_time, , );
     t2.M = Atoi(b.Sign_in_time, , );
     t2.S = Atoi(b.Sign_in_time, , );
     if (t1.H < t2.H)
         return true;
     else if (t1.H == t2.H && t1.M < t2.M)
         return true;
     else if (t1.M == t2.M && t1.S < t2.S)
         return true;
     else
         return false;
 }

 int main()
 {
     vector<Node> N;
     S s;
     int n;
     cin >> n;
     for (int i = ; i < n; i++)
     {
         cin >> s.ID_numebr >> s.Sign_in_time >> s.Sign_out_time;
         N.push_back(s);
     }
     sort(N.begin(), N.end(), comp1);
     cout << N[].ID_numebr<<" ";
     sort(N.begin(), N.end(), comp2);
     cout << N[].ID_numebr;
     return ;
 }