1 #include <iostream>
2 #include <algorithm>
3 #include <string>
4 #include <cmath>
5 using namespace std;
6
7 struct Node
8 {
9 string name;
10 string id;
11 int score;
12 };
13 const int maxn = 1005;
14
15 bool cmp(Node a, Node b){
16 return a.score < b.score;
17 }
18
19 int main(){
20 Node s[maxn];
21 int t;
22 cin >> t;
23 for (int i = 0; i < t; i++){
24 cin >> s[i].name >> s[i].id >> s[i].score;
25 }
26 sort(s, s + t, cmp);
27 cout << s[t - 1].name << " " << s[t - 1].id << endl;
28 cout << s[0].name << " " << s[0].id << endl;
29 return 0;
30 }
