题目1013:开门人和关门人
/*
*/
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int a[1000];
const int MAX=100;
struct E{
char no[20];
char in[10];
char out[10];
}r[MAX];
bool cmp1(E a,E b)
{
return strcmp(a.in,b.in)<0;
}
bool cmp2(E a,E b)
{
return strcmp(a.out,b.out)>0;
}
int main()
{
int n,m,i,j;
//freopen("G:\\in.txt","r",stdin);
//freopen("G:\\our.txt","w",stdout);
while(scanf("%d",&n)!=EOF){
for(i=0;i<n;i++){
scanf("%d",&m);
for(j=0;j<m;j++)
scanf("%s%s%s",r[j].no,r[j].in,r[j].out);
sort(r,r+m,cmp1);
printf("%s ",r[0].no);
sort(r,r+m,cmp2);
printf("%s\n",r[0].no);
}
}
return 0;
}