vector pat b 1015. 德才论 (25)

// test.cpp : 定义控制台应用程序的入口点。
//


#include "stdafx.h"
#include <cstdio>
#include <string>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <cctype>
#include <algorithm>
#include <vector>
using namespace std;


struct stu
{
	char num[10];
	int de;
	int cai;
};




int cmp1(stu a,stu b )
{
		if(a.de+a.cai == b.de+b.cai)
		{
			if(a.de == b.de)
				if(strcmp(a.num,b.num)<0)
					return 1;
				else
					return 0;
			else
				return a.de > b.de;
		}
		else
			return a.de+a.cai > b.de+b.cai;
}


int main()
{
	int a,b,m,n;
	int i,j,k;
	int flag = 0,tmp = 0,tmpp = 0;


	int N,L,H;	
	stu node;
	vector<stu> v1,v2,v3,v4;


	cin>>N>>L>>H;
	k = 0;
	for(i = 0 ; i< N; i++)
	{
		scanf("%s%d%d",node.num,&node.de,&node.cai);
		if(node.de >= L && node.cai >= L)
		{
			k++;
			if(node.de >= H && node.cai >= H)
				v1.push_back(node);
			else
				if(node.de >= H && node.cai < H)
					v2.push_back(node);
				else
					if(node.de < H && node.cai < H && node.de >= node.cai)
						v3.push_back(node);
					else
						v4.push_back(node);
		}
	}


	sort(v1.begin(),v1.end(),cmp1);
	sort(v2.begin(),v2.end(),cmp1);
	sort(v3.begin(),v3.end(),cmp1);
	sort(v4.begin(),v4.end(),cmp1);


	cout<<k<<endl;




	vector<stu>::iterator it;
	for(it = v1.begin() ;it != v1.end() ;it++)
	{
		printf("%s %d %d\n",it->num,it->de,it->cai);
	}
	
	for(it = v2.begin() ;it != v2.end() ;it++)
	{
		printf("%s %d %d\n",it->num,it->de,it->cai);
	}
	for(it = v3.begin() ;it != v3.end() ;it++)
	{
		printf("%s %d %d\n",it->num,it->de,it->cai);
	}
	for(it = v4.begin() ;it != v4.end() ;it++)
	{
		printf("%s %d %d\n",it->num,it->de,it->cai);
	}
	return 0;
}