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

#include <iostream>
#include <cstdio>

using namespace std;

struct Person {
    string id;
    string signInTime;
    string 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;
        }

        Person minSignInTime = person[0];
        Person maxSignOutTime = person[0];
        for (int j = 0; j < m; ++j) {
            if (person[j].signInTime < minSignInTime.signInTime) {
                minSignInTime = person[j];
            }
            if (person[j].signOutTime > maxSignOutTime.signOutTime) {
                maxSignOutTime = person[j];
            }
        }

        cout << minSignInTime.id << " " << maxSignOutTime.id << endl;

    }


    return 0;
}