思路
记录最早出现或最晚走的人的id和时间,一边输入一边比较记录.
代码
#include<iostream>
#include<string>
using namespace std;
int main(){
int n;
cin >> n;
//记录最早进入或最晚出去的人的id和时间
string first_id = "", first_time, last_id = "", last_time;
while(n -- ){
string id, in, out;
cin >> id >> in >> out;
if(first_id == "" || first_time > in){//第一个或有人更早进来
first_id = id;
first_time = in;
}
if(last_id == "" || last_time < out){//第一个或有人更晚出去
last_id = id;
last_time = out;
}
}
cout << first_id << " " << last_id << endl;
}