1 #include<stdio.h> 2  3 #include<algorithm> 4  5 using namespace std; 6  7 #define n 1000 8  9 10 11 struct point12 13 {14 15 char num[n];16 17 char mint[n];18 19 char maxt[n];20 21 }s[n];22 23 24 25 bool cmp(point a,point b)26 27 {28 29 if(strcmp(a.mint,b.mint)<0) return 1;30 31 else return 0;32 33 }34 35 36 37 bool cmp1(point a,point b)38 39 {40 41     if(strcmp(a.maxt,b.maxt)>0) return 1;42 43 else return 0;44 45 }46 47 48 49 int main()50 51 {52 53 int t,i,m;54 55 scanf("%d",&t);56 57 while(t--)58 59 {60 61 scanf("%d",&m);62 63 for(i=0;i<m;i++)64 65 scanf("%s %s %s",s[i].num,s[i].mint,s[i].maxt);66 67 sort(s,s+m,cmp);68 69 printf("%s ",s[0].num);70 71 sort(s,s+m,cmp1);72 73 printf("%s\n",s[0].num);74 75 }76 77 return 0;78 79 }