PAT 甲级 1062 Talent and Virtue (25分)

Note

• 排序

Code:

#include<bits/stdc++.h>
using namespace std;

struct people{
	string id;
	int de,tt,total; 
};

bool compare(people a,people b){
	if(a.total!=b.total) return a.total>b.total;
	else if(a.de!=b.de) return a.de>b.de;
	else return a.id<b.id;
}

// 1.total降序排列; 2.de降序； 3.id升序 
// 1.de&tt>=h; 2.tt<h&&de>=h;
// 3.de&tt<h &&de>=tt; 4.de&tt>=l

int main(){
	#ifndef ONLINE_JUDGE
	freopen("data.txt","r",stdin);
	#endif
	
	int n,l,h;
	struct people p;
	//vector<people> vt[4];
	vector<vector<people>> vt(4);

	cin>>n>>l>>h;
	int count=n;
	for(int i=0;i<n;i++){
		cin>>p.id>>p.de>>p.tt;
		p.total=p.de+p.tt;
		
		if(p.de<l||p.tt<l)
			count--;	
		else if(p.de>=h&&p.tt>=h)
			vt[0].push_back(p);	
		else if(p.de>=h&&p.tt<h)
			vt[1].push_back(p);
		else if(p.de<h&&p.tt<h&&p.de>=p.tt)
			vt[2].push_back(p);
		else
			vt[3].push_back(p);		
	}
	
	cout<<count<<endl;
	for(int i=0;i<4;i++){
		sort(vt[i].begin(),vt[i].end(),compare);
		for(int j=0;j<vt[i].size();j++){
			cout<<vt[i][j].id<<" "<<vt[i][j].de<<" "<<vt[i][j].tt<<endl;
		}
	}
	
	return 0;
}