简单题要加速啊!!!
#include "stdafx.h"
#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
struct stu{
char name[11];
char id[11];
char gender;
int grade;
};
vector<stu> M,F;
bool cmpF(stu u1,stu u2){
return u1.grade>u2.grade;
}
bool cmpM(stu u1,stu u2){
return (u1.grade<u2.grade);
}
int main(){
int N,i;
cin>>N;
for(i=0;i<N;i++){
stu s;
scanf("%s %c %s %d",s.name,&s.gender,s.id,&s.grade);
if(s.gender=='F')
F.push_back(s);
else
M.push_back(s);
}
sort(F.begin(),F.end(),cmpF);
sort(M.begin(),M.end(),cmpM);
if(F.size())
cout<<F[0].name<<" "<<F[0].id<<endl;
else
cout<<"Absent"<<endl;
if(M.size())
cout<<M[0].name<<" "<<M[0].id<<endl;
else
cout<<"Absent"<<endl;
if(F.size()&&M.size())
cout<<F[0].grade-M[0].grade;
else
cout<<"NA";
system("pause");
return 0;
}