PAT甲1036 简单模拟

题目链接

代码

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
struct node{
	string name;
	string id;
	int score;
};
vector<node> v1,v2;
bool cmp(node a,node b)
{
	return a.score<b.score;
}
int main()
{
	int n;
	cin>>n;
	node t;
	char c;
	for(int i=1;i<=n;i++)
	{
		cin>>t.name>>c>>t.id>>t.score;
		if(c=='M')
			v1.push_back(t);
		else
			v2.push_back(t);
	}
	sort(v1.begin(),v1.end(),cmp);
	sort(v2.begin(),v2.end(),cmp);
	if(v2.size()==0)
	{
		cout<<"Absent"<<endl;
		cout<<v1[0].name<<" "<<v1[0].id<<endl;
		cout<<"NA";
	}
	else if(v1.size()==0)
	{
		cout<<v2[v2.size()-1].name<<" "<<v2[v2.size()-1].id<<endl;
		cout<<"Absent"<<endl;
		cout<<"NA";
	}
	else
	{
		cout<<v2[v2.size()-1].name<<" "<<v2[v2.size()-1].id<<endl;
		cout<<v1[0].name<<" "<<v1[0].id<<endl;
		cout<<v2[v2.size()-1].score-v1[0].score;
	}
	return 0;
}