#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <string>
#include <map>
using namespace std;
struct Node
{
string id;
int in;
int out;
};
bool cmp1(Node a,Node b)
{
return a.in<b.in;
}
bool cmp2(Node a,Node b)
{
return a.out>b.out;
}
int main()
{
int n;
cin>>n;
vector<Node> v;
int inh,inm,ins;
int ouh,oum,ous;
Node tmp;
for(int i=0;i<n;i++)
{
cin>>tmp.id;
scanf("%d:%d:%d",&inh,&inm,&ins);
scanf("%d:%d:%d",&ouh,&oum,&ous);
tmp.in=inh*3600+inm*60+ins;
tmp.out=ouh*3600+ouh*60+ous;
v.push_back(tmp);
}
sort(v.begin(),v.end(),cmp1);
string in1;
in1=v[0].id;
string out1;
sort(v.begin(),v.end(),cmp2);
out1=v[0].id;
cout<<in1<<" "<<out1<<endl;
}
1006. Sign In and Sign Out (25)
最新推荐文章于 2022-06-30 13:07:24 发布