HDOJ 1234 开门人和关门人

http://acm.hdu.edu.cn/showproblem.php?pid=1234

#include<string.h>

#include<ctype.h>
#include<iostream>
#include<algorithm>
using namespace std;
#define N 1000
struct jilu
{
char name[N];
char s[N],e[N];
}a[N];
int cmp1(jilu x,jilu y)//找开门人 
{
return strcmp(x.s,y.s)<0;
}
int cmp2(jilu x,jilu y)//找开门人 
{
return strcmp(x.e,y.e)>0;
}
int main()
{
int i;
int n,m;
scanf("%d",&n);
while(n--)
{
scanf("%d",&m);
for(i=0;i<m;i++)
scanf("%s%s%s",a[i].name,a[i].s,a[i].e);
sort(a,a+m,cmp1);
printf("%s ",a[0].name);
sort(a,a+m,cmp2);
printf("%s\n",a[0].name);
}
return 0;
}