这题用结构体c++真的很简单;
#include<iostream>
#include<algorithm>
using namespace std;
struct nood{
string s1;
string s2;
int grade;
}stu[1000];
bool cmp(nood a,nood b)
{
return a.grade>b.grade;
}
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>stu[i].s1>>stu[i].s2>>stu[i].grade;
}
sort(stu,stu+n,cmp);
cout<<stu[0].s1<<" "<<stu[0].s2<<endl;
cout<<stu[n-1].s1<<" "<<stu[n-1].s2<<endl;
return 0;
}