PAT甲级1006 结构体排序

题目链接：传送门

结构体排序一下就好，我发现我老是犯一些很愚蠢的错误，我out数组都没排序居然都能过三个样例，样例也是有够水的。

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
#define inf 4000000000000000000
using namespace std;
typedef long long ll;
const ll maxn=1e6+50;
const ll mod=1e9+7;
const double eps=1e-9;
char s[maxn][20];
struct node
{
	ll h,m,s,id;
}in[maxn],out[maxn];
bool cmp(node a,node b)
{
	if(a.h==b.h)
	{
		if(a.m==b.m)
		{
			return a.s<b.s;
		}
		return a.m<b.m;
	}
	return a.h<b.h;
}
int main()
{
	ll n;
	scanf("%lld",&n);
	for(ll i=1;i<=n;i++)
	{
		scanf("%s",s[i]);
		scanf("%lld:%lld:%lld %lld:%lld:%lld",&in[i].h,&in[i].m,&in[i].s,&out[i].h,&out[i].m,&out[i].s);
		in[i].id=i;out[i].id=i;
	}
	sort(in+1,in+1+n,cmp);
	sort(out+1,out+1+n,cmp);
	printf("%s %s\n",s[in[1].id],s[out[n].id]);
	//scanf("%lld",&n);
	return 0;
}