Problem : 1234 ( 开门人和关门人 ) Judge Status : Accepted
RunId : 5938210 Language : C++ Author : qq1203456195
Code Render Status : Rendered By HDOJ C++ Code Render Version 0.01 Beta
RunId : 5938210 Language : C++ Author : qq1203456195
Code Render Status : Rendered By HDOJ C++ Code Render Version 0.01 Beta
#include <cstdio>
#include <algorithm>
using namespace std;
char name[100][20];
typedef struct
{
int ah,am,as;
int id;
}AREC;
typedef struct
{
int lh,lm,ls;
int id;
}LREC;
AREC arr[100];
LREC lea[100];
int cmparr(const AREC& a,const AREC& b)
{
if(a.ah!=b.ah)
return a.ah<b.ah;
if(a.am!=b.am)
return a.am<b.am;
return a.as<b.as;
}
int cmplea(const LREC& a,const LREC& b)
{
if(a.lh!=b.lh)
return a.lh>b.lh;
if(a.lm!=b.lm)
return a.lm>b.lm;
return a.ls>b.ls;
}
int main()
{
int i,n,cas;
scanf("%d",&cas);
while (cas--)
{
scanf("%d",&n);
for (i=0;i<n;i++)
{
arr[i].id=i;
lea[i].id=i;
scanf("%s %d:%d:%d %d:%d:%d",name[i],&arr[i].ah,&arr[i].am,&arr[i].as,&lea[i].lh,&lea[i].lm,&lea[i].ls);
}
sort(arr,arr+n,cmparr);
sort(lea,lea+n,cmplea);
printf("%s %s\n",name[arr[0].id],name[lea[0].id]);
}
return 0;
}