题解 | #开门人和关门人#

#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

struct Person {
    string id;
    string signInTime;
    string signOutTime;
};

/**
 * 按签到时间升序排序
 * @param x
 * @param y
 * @return
 */
bool compareSignInTimeAscend(Person x, Person y) {
    return x.signInTime < y.signInTime;
}

/**
 * 按签退时间降序排序
 * @param x
 * @param y
 * @return
 */
bool compareSignOutTimeDescend(Person x, Person y) {
    return x.signOutTime > y.signOutTime;
}

/**
 * 开门人和关门人
 * @return
 */
int main() {
    int m;
    while (cin >> m) {
        Person* person = new Person[m];
        for (int i = 0; i < m; ++i) {
            cin >> person[i].id >> person[i].signInTime >> person[i].signOutTime;
        }
        sort(person, person + m, compareSignInTimeAscend);
        cout << person[0].id << " ";
        sort(person, person + m, compareSignOutTimeDescend);
        cout << person[0].id << endl;
    }

    return 0;
}