#include<iostream>
#include<math.h>
#include<algorithm>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<vector>
using namespace std;
#define INF 100000000
#define maxn 100010
struct member
{
string id;
int atime;
int ltime;
};
int time_to_second(int h,int min,int sec)
{
return h*3600+min*60+sec;
}
bool cmp(member a,member b)
{ return a.ltime>b.ltime;
}
int main(){
vector<member> v;
int num;
cin>>num;
for(int i=0;i<num;i++)
{
member temp;
int h,min,sec;
cin>>temp.id;
scanf("%d:%d:%d",&h,&min,&sec);
temp.atime=time_to_second(h,min,sec);
scanf("%d:%d:%d",&h,&min,&sec);
temp.ltime=time_to_second(h,min,sec);
v.push_back(temp);}
int store=-1,minm=INF;
for(int j=0;j<v.size();j++)
{
if(v[j].atime<minm)
{
store=j;
minm=v[j].atime;
}
}
cout<<v[store].id<<" ";
sort(v.begin(),v.end(),cmp);
cout<<v[0].id;
return 0;
}
PAT程序设计考题——甲级1006(Sign In and Sign Out ) C++实现
最新推荐文章于 2022-07-13 11:09:45 发布