#include<stdlib.h>
#include<stdio.h>
struct node{
char s[15];
int hour1;
int fen1;
int mia1;
int hour2;
int fen2;
int mia2;
}c[100];
int cmp(const void *a,const void *b)//qsotrt 排序 三级结构体排序
{
struct node *c=(node *)a;
struct node *d=(node *)b;
if(c->hour1!=d->hour1) return c->hour1-d->hour1;
else if(c->fen1!=d->fen1)
return c->fen1-d->fen1;
else return c->mia1-d->mia1;
}
int cop(const void *a,const void *b)//qsort 排序 三级结构体排序
{
struct node *c=(node *)a;
struct node *d=(node *)b;
if(c->hour2!=d->hour2) return d->hour2-c->hour2;
else if(c->fen2!=d->fen2)
return d->fen2-c->fen2;
else return d->mia2-c->mia2;
}
main()
{
int n;
scanf("%d",&n);
while(n--)
{
int m;
scanf("%d",&m);
char s1[15],s2[15];
for(int i=0;i
{
scanf("%s %d:%d:%d %d:%d:%d",c[i].s,&c[i].hour1,&c[i].fen1,&c[i].mia1,&c[i].hour2,&c[i].fen2,&c[i].mia2);
}
qsort(c,m,sizeof(c[0]),cmp);
printf("%s ",c[0].s);
qsort(c,m,sizeof(c[0]),cop);
printf("%s\n",c[0].s);
}
}
版权声明：本文为博主原创文章，未经博主允许不得转载。