模拟:
#include<iostream>
using namespace std;
int main(){
int n;cin>>n;
int maxn=0,minn=100;
string max_name,max_num,min_name,min_num;
while(n--){
string t_name,t_num;int score;
cin>>t_name>>t_num>>score;
if(score>maxn)
max_name=t_name,max_num=t_num,maxn=score;
if(score<minn)
min_name=t_name,min_num=t_num,minn=score;
}
cout<<max_name<<' '<<max_num<<endl;
cout<<min_name<<' '<<min_num<<endl;
return 0;
}
排序:
#include<bits/stdc++.h>
using namespace std;
struct stu{
string name,num;
int score;
};
int cmp(stu a,stu b){
return a.score>b.score;
}
int main()
{
int n;cin>>n;
stu a[n];
for(int i=0;i<n;i++){
cin>>a[i].name>>a[i].num>>a[i].score;
}
sort(a,a+n,cmp);
cout<<a[0].name<<' '<<a[0].num<<endl;
cout<<a[n-1].name<<' '<<a[n-1].num<<endl;
return 0;
}