思路：

用min_element和max_element就好啦~

程式碼如下：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
#include<queue>
#include<cmath>
#include<set>
#include<sstream>
#define ll long long
using namespace std;
const int N=1005,INF=0x3f3f3f3f;
string id[N],in[N],out[N];
int main(){
    int m;
    scanf("%d",&m);
    ios::sync_with_stdio(false);
    for(int i=0;i<m;i++){
        cin>>id[i]>>in[i]>>out[i];
    }
    int seq=min_element(in,in+m)-in;
    cout<<id[seq]<<" ";
    seq=max_element(out,out+m)-out;
    cout<<id[seq]<<endl;
}