PAT乙级1004

用结构体很方便

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct student{
	string sname,sid;
	int point;
}s[100010];
bool cmp(student a,student b)
{
	return a.point>b.point; 
}

int main()
{
	int n;
	cin>>n;
	for(int i=0;i<n;i++) cin>>s[i].sname>>s[i].sid>>s[i].point;
	sort(s,s+n,cmp);
	cout<<s[0].sname<<' '<<s[0].sid<<endl;
	cout<<s[n-1].sname<<' '<<s[n-1].sid;
	return 0;
}