hdu1234 开门人和关门人

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<algorithm>
using namespace std;

struct point
{
	char name[16];
	int h1,m1,s1,h2,m2,s2;
}num[10001];

bool cmp1(point x,point y){ return (x.h1<y.h1 || (x.h1==y.h1 && x.m1<y.m1) || (x.h1==y.h1 && x.m1==y.m1 && x.s1<y.s1));}
bool cmp2(point x,point y){ return (x.h2>y.h2 || (x.h2==y.h2 && x.m2>y.m2) || (x.h2==y.h2 && x.m2==y.m2 && x.s2>y.s2));}

int main()
{
    int n,i,t;
    scanf("%d",&t);
	while(t--)
	{
        scanf("%d",&n);
		for(i=0;i<n;i++){
			scanf("%s %d:%d:%d %d:%d:%d",num[i].name,&num[i].h1,&num[i].m1,&num[i].s1,&num[i].h2,&num[i].m2,&num[i].s2);
			getchar();
		}

		sort(num,num+n,cmp1);
		printf("%s ",num[0].name);

		sort(num,num+n,cmp2);
		printf("%s\n",num[0].name);
    }
    return 0;
}