1015 德才论

#include
using namespace std;
int n,l,h;
typedef struct stu{
	int id;
	int ds;
	int cs;
	int sum;
 stu(int id1,int ds1,int cs1,int sum1){
		id=id1;
		ds=ds1;
		cs=cs1;
		sum=sum1;
	}
	stu(){
	}
}stu;
bool cmp(stu s1,stu s2){
	
		if(s1.sum!=s2.sum){
			return s1.sum>s2.sum;
		}else if(s1.ds!=s2.ds){
			return s1.ds>s2.ds;
		}else return s1.id>n>>l>>h;
	vectora1;
	vectora2;
	vectora3;
	vectora4;
	int ans=0;
	for(int i=0;i>id1>>ds1>>cs1;
		sum1=ds1+cs1;
		
		stu s(id1,ds1,cs1,sum1);
		if(s.ds>=l&&s.cs>=l){
			ans++;
			if(s.ds>=h&&s.cs>=h)
			a1.push_back(s);
			else if(s.ds>=h&&s.cs=s.cs){
				a3.push_back(s);
			}else a4.push_back(s);
		}
	}
	sort(a1.begin(),a1.end(),cmp);
	sort(a2.begin(),a2.end(),cmp);
	sort(a3.begin(),a3.end(),cmp);
	sort(a4.begin(),a4.end(),cmp);
	cout<