PAT (Basic Level) Practice-1015 德才论 (25 分)

#include<bits/stdc++.h>
#define MAXN 100100
using namespace std;
typedef long long ll;

ll N,L,H;
ll aa,bb,cc,dd;
ll k1=0,k2=0,k3=0,k4=0;
ll tot = 0;
struct node{
	ll xuhao;
	ll de;
	ll cai;
	ll sum;
}one[MAXN],second[MAXN],third[MAXN],fourth[MAXN];

ll cmpp(node x,node y){
	if(x.sum == y.sum){
	  if(x.de == y.de) return x.xuhao < y.xuhao;
	  else return x.de > y.de;
    }
	else
		return x.sum > y.sum;  
}

int main(){
	cin>>N>>L>>H;
	for(ll i=0;i<N;i++){
		cin>>aa>>bb>>cc;
		if(bb>=L && cc>=L) tot ++;
		if(bb>=H && cc>=H){//德才双全 
		   one[k1].xuhao = aa;
		   one[k1].de = bb;
		   one[k1].cai = cc;
		   one[k1].sum = bb + cc;
		   k1++;
	    }
	    else if(bb>=H &&(cc>=L && cc<H)){//德胜才 
	    	second[k2].xuhao = aa;
	    	second[k2].de = bb;
	    	second[k2].cai = cc;
	    	second[k2].sum = bb+cc;
	    	k2++;
		}
		else if((bb < H && bb >=L) && (cc < H && cc>=L) && bb >= cc){//才胜德 
			 third[k3].xuhao = aa;
			 third[k3].de = bb;
			 third[k3].cai = cc;
			 third[k3].sum = bb+cc;
			 k3++;
		}
		else if(bb>=L && cc>=L){
			fourth[k4].xuhao = aa;
			fourth[k4].de = bb;
			fourth[k4].cai = cc;
			fourth[k4].sum = bb+cc;
			k4++;
		}
	}
	 
	sort(one,one+k1,cmpp);
	sort(second,second+k2,cmpp);
	sort(third,third+k3,cmpp);
	sort(fourth,fourth+k4,cmpp);
	
	cout<<tot<<endl;
	for(ll i =0;i<k1;i++){
		cout<<one[i].xuhao<<" "<<one[i].de<<" "<<one[i].cai<<endl;
	}
	for(ll i =0;i<k2;i++){
		cout<<second[i].xuhao<<" "<<second[i].de<<" "<<second[i].cai<<endl;
	}
	for(ll i =0;i<k3;i++){
		cout<<third[i].xuhao<<" "<<third[i].de<<" "<<third[i].cai<<endl;
	}
	for(ll i =0;i<k4;i++){
		cout<<fourth[i].xuhao<<" "<<fourth[i].de<<" "<<fourth[i].cai<<endl;
	}
	return 0;
}