1015 德才论

最新推荐文章于 2024-09-13 16:27:15 发布

代码无bug

最新推荐文章于 2024-09-13 16:27:15 发布

阅读量51

点赞数

分类专栏： pat乙级文章标签：算法 c++ 开发语言

本文链接：https://blog.csdn.net/aaronyyds/article/details/133963980

版权

pat乙级专栏收录该内容

14 篇文章 0 订阅

订阅专栏

#include<bits/stdc++.h>
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<s2.id;
	
}
int main(){
	cin>>n>>l>>h;
	vector<stu>a1;
	vector<stu>a2;
	vector<stu>a3;
	vector<stu>a4;
	int ans=0;
	for(int i=0;i<n;i++){
		
		int id1,ds1,cs1,sum1;
		cin>>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<h){
				a2.push_back(s);
			}else if(s.ds<h&&s.cs<h&&s.ds>=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<<ans<<endl;
	for(int i=0;i<a1.size();i++){
		cout<<a1[i].id<<" "<<a1[i].ds<<" "<<a1[i].cs<<endl;
	} 
	for(int i=0;i<a2.size();i++){
		cout<<a2[i].id<<" "<<a2[i].ds<<" "<<a2[i].cs<<endl;
	} 
	for(int i=0;i<a3.size();i++){
		cout<<a3[i].id<<" "<<a3[i].ds<<" "<<a3[i].cs<<endl;
	} 
	for(int i=0;i<a4.size();i++){
		cout<<a4[i].id<<" "<<a4[i].ds<<" "<<a4[i].cs<<endl;
	} 
}