如果是结构体类型的STL容器,用sort排序必须带上cmp函数不然报错。。
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
typedef struct Node{
string name,card;
char t;
int score;
} node;
vector<node> male;
vector<node> female;
bool cmp(node a,node b)
{
return a.score < b.score;
}
int main()
{
int n;
cin >> n;
for(int i=0;i<n;i++)
{
node temp;
cin>>temp.name>>temp.t>>temp.card>>temp.score;
if(temp.t == 'M')
male.push_back(temp);
else if(temp.t == 'F')
female.push_back(temp);
}
bool flag1 = false,flag2 = false;
if(male.size() != 0)
{
sort(male.begin(),male.end(),cmp);
flag1 = true;
}
if(female.size() != 0)
{
sort(female.begin(),female.end(),cmp);
flag2 = true;
}
if(flag2 == true)
cout << female[female.size()-1].name<<" " << female[female.size()-1].card << endl;
else
cout << "Absent"<<endl;
if(flag1 == true)
cout << male[0].name << " "<<male[0].card << endl;
else
cout << "Absent"<<endl;
if(flag2 == true && flag1 == true)
cout << (abs(male[0].score - female[female.size()-1].score))<<endl;
else
cout <<"NA"<<endl;
return 0;
}