import java.util.Comparator;
import java.util.Scanner;
import java.util.TreeSet;
 
public class PoliticalDemo {
	 static class student{
	    int id,de,cai,total;
		public student(int id, int de, int cai) {
			super();
			this.id = id;
			this.de = de;
			this.cai = cai;
			this.total = cai+de;
		}	  
	  }
	 
  public static void main(String[] args) {
	 Scanner in = new Scanner(System.in);

	  Comparator<student> c =new Comparator<student>() {
		  @Override
			public int compare(student s1, student s2) {
				 if(s1.total!=s2.total){
					 return s2.total-s1.total;
				 }else if(s1.de!=s2.de){
					 return s2.de-s1.de;
				 }else{
					 return s1.id-s2.id;
				 }		}
	};
	TreeSet<student> tree1 = new TreeSet<>(c);
     TreeSet<student> tree2 = new TreeSet<>(c);
     TreeSet<student> tree3 = new TreeSet<>(c);
     TreeSet<student> tree4 = new TreeSet<>(c);
     
		 int n = in.nextInt();
		 int l = in.nextInt();
		 int h = in.nextInt();		 
		 while(n>0){
			 int id = in.nextInt();
			 int de = in.nextInt();
			 int cai =in.nextInt();					 
		     student s = new student(id,de,cai);	 			 
			 if(s.cai>=l&&s.de>=l){
				 if(s.cai>=h&&s.de>=h){
					 	tree1.add(s);
				 		}
				 		else if(s.de>=h){
		    	        tree2.add(s);
				  }else if(s.de>=s.cai){
					    tree3.add(s);
				  }else{
					    tree4.add(s);
				  }
			 }
			 n--;
		 }
		 System.out.println(tree1.size()+tree2.size()+tree3.size()+tree4.size());
	     for(student s :tree1){
	    	 System.out.println(s.id+" "+s.de+" "+s.cai);
	     }
	     for(student s :tree2){
	    	 System.out.println(s.id+" "+s.de+" "+s.cai);
	     }
	     for(student s :tree3){
	    	 System.out.println(s.id+" "+s.de+" "+s.cai);
	     }
	     for(student s :tree4){
	    	 System.out.println(s.id+" "+s.de+" "+s.cai);
	     }	 		 

}
}

我写的好复杂呀。。。还是得多多磨炼

#include <bits/stdc++.h>
using namespace std;
int n,l,h;
typedef struct {
	int no;
	int moral;
	int talent;
} Student;
bool cmp(Student a,Student b) {
	if(a.moral>=h&&a.talent>=h) {
		if(b.moral>=h&&b.talent>=h)
			if(a.moral+a.talent!=b.moral+b.talent)
				return a.moral+a.talent>b.moral+b.talent;
			else if(a.moral!=b.moral) return a.moral>b.moral;
			else return a.no<b.no;
		else return true;
	} else if(a.moral>=h&&a.talent<h) {
		if(b.moral>=h&&b.talent<h)
			if(a.moral+a.talent!=b.moral+b.talent)
				return a.moral+a.talent>b.moral+b.talent;
			else if(a.moral!=b.moral) return a.moral>b.moral;
			else return a.no<b.no;
		else if(b.moral>=h&&b.talent>=h)
			return false;
		else return true;
	} else if(a.moral<h&&a.talent<h&&a.moral>=a.talent) {
		if(b.moral<h&&b.talent<h&&b.moral>=b.talent)
			if(a.moral+a.talent!=b.moral+b.talent)
				return a.moral+a.talent>b.moral+b.talent;
			else if(a.moral!=b.moral) return a.moral>b.moral;
			else return a.no<b.no;
		else if((b.moral>=h&&b.talent<h)||(b.moral>=h&&b.talent>=h))
			return false;
		else return true;
	} else {
		if((b.moral>=h&&b.talent<h)||(b.moral>=h&&b.talent>=h)||(b.moral<h&&b.talent<h&&b.moral>=b.talent)) 
			return false;
		else if(a.moral+a.talent!=b.moral+b.talent)
			return a.moral+a.talent>b.moral+b.talent;
		else if(a.moral!=b.moral) return a.moral>b.moral;
		else return a.no<b.no;

	}
}
int main() {
	int x,y,z;
	cin>>n>>l>>h;
	vector<Student> students;
	for(int i=0; i<n; ++i) {

		cin>>x>>y>>z;
		if(y<l||z<l) continue;
		Student stu;
		stu.no=x;
		stu.moral=y;
		stu.talent=z;
		students.push_back(stu);
		//cin>>student[i].no>>student[i].moral>>student[i].talent;
	}
	sort(students.begin(),students.end(),cmp);
	cout<<students.size()<<endl;
	for(int i=0; i<students.size(); ++i) {
		cout<<students[i].no<<" "<<students[i].moral<<" "<<students[i].talent<<endl;
	}

	return 0;
}

这样子的题目切记细心分析，步步为营就可以了




#include <iostream>

#include <vector>

#include <algorithm>

using namespace std;



struct Stu{

    bool operator<(const Stu& b)

    {

        if ((this->c + this->d) != (b.c + b.d))

            return ((this->c + this->d) >(b.c + b.d));

        else

            return (this->d == b.d)? (this->id < b.id) : (this->d > b.d);

    }

    int id;

    int d;

    int c;

};

void print(const Stu& s)

{

    cout << s.id << " " << s.d << " " << s.c << " "<< endl;

}



int main()

{

    int N,L,H,cnt = 0;

    cin >> N >> L >> H;

    vector<Stu> v[4];

    for (int i = 0; i < N; i++)

    {

        Stu Info;

        cin >> Info.id >> Info.d >> Info.c;

        if (Info.d >= L && Info.c >= L)

        {

            if (Info.d >= H && Info.c >= H)

                v[0].push_back(Info);

            else if (Info.d >= H && Info.c < H)

                v[1].push_back(Info);

            else if (Info.d < H && Info.c < H && Info.d >= Info.c)

                v[2].push_back(Info);

            else

                v[3].push_back(Info);

            cnt++;

        }    

    }

    cout << cnt << endl;

    for (int i = 0; i < 4; i++)

    {

        sort(v[i].begin(), v[i].end());

        for (auto e : v[i])print(e);

    }

    return 0;

}

// 思路，sort排序按照结构体的相关结构即可。
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
// 第一类 德分和才分均不低于此线的被定义为“才德全尽”，此类考生按德才总分从高到低排序；
// 才分不到但德分到线的一类考生属于“德胜才”，也按总分排序，但排在第一类考生之后；
// 德才分均低于H，但是德分不低于才分的考生属于“才德兼亡”但尚有“德胜才”者，按总分排序，
// 但排在第二类考生之后；
// 其他达到最低线L的考生也按总分排序，但排在第三类考生之后。
// 当某类考生中有多人总分相同时，按其德分降序排列；
// 若德分也并列，则按准考证号的升序输出。
typedef struct
{
    string id;
    int scoreDe;
    int scoreCai;
    int sumScore;
}student;
int ChooseClass(student &s, int H, int L)
{
    int class_student = 0;
    if(s.scoreCai >= H && s.scoreDe >= H)
    {
        class_student = 1;
    }
    else if(s.scoreCai >= L && s.scoreDe >= H)
    {
        class_student = 2;
    }
    else if(s.scoreCai >= L && s.scoreDe >= L && s.scoreCai <= s.scoreDe)
    {
        class_student = 3;
    }
    else if(s.scoreCai >= L && s.scoreDe >= L)
    {
        class_student = 4;
    }
    else
    {
        class_student = 5;
    }
    s.sumScore = s.scoreCai + s.scoreDe;
    return class_student;
}

bool cmp(student &a ,student &b)
{     if (a.sumScore > b.sumScore)     {         return true;     }
    else if(a.sumScore == b.sumScore)
    {
        if(a.scoreDe > b.scoreDe)
        {
            return true;
        }
        else if(a.scoreDe == b.scoreDe)
        {
            if(a.id < b.id)
            {
                return true;
            }
        }
    }     return false ;
}
int main()
{
    int N,L,H;
    cin >> N >> L >> H;

    string temp_id;
    int tempScoreDe;
    int tempScoreCai;
    vector<student> stu[5];
    student *pStudent = new student[N];
    for(int i=0; i<N; i++)
    {
        cin >> temp_id;
        cin >> tempScoreDe;
        cin >> tempScoreCai;
        pStudent[i].scoreCai = tempScoreCai;
        pStudent[i].scoreDe = tempScoreDe;
        pStudent[i].id = temp_id;
        stu[ChooseClass(pStudent[i], H, L)-1].push_back(pStudent[i]);
    }
    cout << stu[0].size() + stu[1].size() + stu[2].size() + stu[3].size() << endl;
    for(int i=0; i<4; i++){
        sort(stu[i].begin(),stu[i].end(),cmp);
        for(int j=0; j<stu[i].size(); j++)
        {
            cout << stu[i][j].id << " " << stu[i][j].scoreDe << " " << stu[i][j].scoreCai << endl;
        }
    }

}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Iterator;
import java.util.TreeSet;

	



	public class Main {



	    private static class Student implements Comparable<Student>{



	        publicStudent(intid, intmorality, intability) {



	            // TODO Auto-generated constructor stub



	            this.id = id;



	            this.morality = morality;



	            this.ability = ability;



	        }



	        int id = 0;



	        int morality = 0;



	        int ability = 0;



	 



	        @Override



	        public int compareTo(Student o) {



	            // TODO Auto-generated method stub



	             



	            intresult = 0;



	 



	            if(o instanceof Student) {



	                Student student = (Student)o;



	                 



	                if((this.ability + this.morality) >



	                    (student.ability + student.morality)) {



	                    result = -1;



	                }elseif((this.ability + this.morality) ==



	                (student.ability + student.morality)) {



	                    if(this.morality > student.morality) {



	                        result = -1;



	                    }elseif(this.morality == student.morality) {



	                        if(this.id < student.id) {



	                            result = -1;



	                        }elseif(this.id == student.id) {



	                            result = 0;



	                        }else{



	                            result = 1;



	                        }



	                    }else{



	                        result = 1;



	                    }



	                }else{



	                    result = 1;



	                }



	            }



	            return result;



	        }



	         



	        public void print Student() {



	            System.out.println(this.id + " "+



	                    this.morality + " "+ this.ability);



	        }



	    }



	 



	     



	    public static void main(String[] args) throws IOException {



	        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));



	         



	        String line = bufferedReader.readLine();



	        String[] params = line.split(" ");



	         



	        intN = 0;



	        intL = 0;



	        intH = 0;



	         



	        N = Integer.parseInt(params[0]);



	        L = Integer.parseInt(params[1]);



	        H = Integer.parseInt(params[2]);



	         



	        Student[] students = newStudent[N];



	         



	        for(int i = 0; i < N; i++) {



	            line = bufferedReader.readLine();



	            params = line.split(" ");



	            students[i] = newStudent(Integer.parseInt(params[0]), Integer.parseInt(params[1]),Integer.parseInt(params[2]));



	        }



	         



	        TreeSet[] studentClass = new TreeSet[4];



	         



	        studentClass[0] = new TreeSet<Student>();



	        studentClass[1] = new TreeSet<Student>();



	        studentClass[2] = new TreeSet<Student>();



	        studentClass[3] = new TreeSet<Student>();



	         



	        int passStudentCount = 0;



	         



	        for(int i = 0; i < students.length; i++) {



	            if(students[i].ability >= H && students[i].morality >= H) {



	                studentClass[0].add(students[i]);



	                passStudentCount++;



	            }elseif(students[i].ability >= L && students[i].ability < H &&



	                    students[i].morality >= H) {



	                studentClass[1].add(students[i]);



	                passStudentCount++;



	            }elseif(students[i].ability >= L && students[i].ability < H &&



	                    students[i].morality >= L && students[i].morality < H &&



	                    students[i].morality >= students[i].ability) {



	                studentClass[2].add(students[i]);



	                passStudentCount++;



	            }elseif(students[i].ability >= L && students[i].morality >= L) {



	                studentClass[3].add(students[i]);



	                passStudentCount++;



	            }



	        }



	         



	        System.out.println(passStudentCount);



	         



	        Iterator<Student> treeSetIterator = null;



	         



	        for(int i = 0; i < studentClass.length; i++) {



	            treeSetIterator = studentClass[i].iterator();



	            while(treeSetIterator.hasNext()) {



	                Student tempStudent = treeSetIterator.next();



	                tempStudent.printStudent();



	            }



	        }



	    }



	}

import java.util.Scanner;
import java.util.TreeSet;

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int N  = in.nextInt();
        int L = in.nextInt();
        int H = in.nextInt();
        TreeSet<Student> students = new TreeSet<Student>();
        for (int i = 0; i < N; i ++) {
            Student student = new Student(in.nextInt(), in.nextInt(), in.nextInt(), H);
            if (student.de >= L && student.cai >= L)
                students.add(student);
        }
        System.out.println(students.size());
        for (Student student : students)
            System.out.println(student.id + " " + student.de + " " + student.cai);


    }
    static class Student implements Comparable<Student>{
        int id, de, cai, level;
        Student(int id, int de, int cai, int H) {
            this.id = id;
            this.de = de;
            this.cai = cai;
            if (this.de >= H && this.cai >= H)
                level = 4;
            else if (this.de >= H)
                level = 3;
            else if (this.de >= this.cai)
                level = 2;
            else
                level = 1;
        }

        @Override
        public int compareTo(Student o) {
            int sum1 = this.de + this.cai;
            int sum2 = o.de + o.cai;
            if (this.level > o.level)
                return -1;
            else if(this.level == o.level) {
                if (sum1 > sum2)
                    return -1;
                else if(sum1 == sum2) {
                    if (this.de > o.de)
                        return -1;
                    else if (this.de == o.de && this.id < o.id)
                        return -1;
                }
            }
            return 1;
        }
    }
}

为什么总是提示内存超限，感觉没什么问题，求解答?

	importjava.util.ArrayList;



	importjava.util.Scanner;



	 



	publicclassMain {



	    publicstaticvoidmain(String[] args) {



	        Scanner in = newScanner(System.in);



	        while(in.hasNext()){



	            intn=in.nextInt(),L=in.nextInt(),H=in.nextInt();



	            int[] ids=newint[n];



	            int[] des=newint[n];



	            int[] cais=newint[n];



	            int[] totals=newint[n];



	            ArrayList<Integer> list1=newArrayList<Integer>();



	            ArrayList<Integer> list2=newArrayList<Integer>();



	            ArrayList<Integer> list3=newArrayList<Integer>();



	            ArrayList<Integer> list4=newArrayList<Integer>();



	            intM=0;



	            for(inti = 0; i < n; i++) {



	                ids[i]=in.nextInt();



	                des[i]=in.nextInt();



	                cais[i]=in.nextInt();



	                totals[i]=des[i]+cais[i];



	                 



	                if(des[i]>=L && cais[i]>=L){



	                    M++;



	                    if(des[i]>=H && cais[i]>=H){//1



	                        list1.add(i);



	                    }



	                    elseif(cais[i]<=H && des[i]>=H){//2



	                        list2.add(i);



	                    }



	                    elseif(cais[i]<=H && des[i]<=H && des[i]>=cais[i]){//3



	                        list3.add(i);



	                    }



	                    else{//4



	                        list4.add(i);



	                    }



	                }



	            }



	            System.out.println(M);



	             



	            intlen1=list1.size(),len2=list2.size(),len3=list3.size(),len4=list4.size();



	            Integer[] index=newInteger[]{};



	             



	            index=list1.toArray(index);



	            fun(len1,index,totals,ids,cais,des);



	            for(inti = 0; i < len1; i++) {



	                System.out.printf("%d %d %d\n",ids[index[i]],des[index[i]],cais[index[i]]);



	            }



	             



	            index=list2.toArray(index);



	            fun(len2,index,totals,ids,cais,des);



	            for(inti = 0; i < len2; i++) {



	                System.out.printf("%d %d %d\n",ids[index[i]],des[index[i]],cais[index[i]]);



	            }



	             



	            index=list3.toArray(index);



	            fun(len3,index,totals,ids,cais,des);



	            for(inti = 0; i < len3; i++) {



	                System.out.printf("%d %d %d\n",ids[index[i]],des[index[i]],cais[index[i]]);



	            }



	             



	            index=list4.toArray(index);



	            fun(len4,index,totals,ids,cais,des);



	            for(inti = 0; i < len4; i++) {



	                System.out.printf("%d %d %d\n",ids[index[i]],des[index[i]],cais[index[i]]);



	            }



	        }



	    }



	     



	    privatestaticvoidfun(intlen,Integer[] index,int[] totals,int[] ids,int[] cais,int[] des){



	        int[] tempTotals=newint[len];



	        int[] tempIds=newint[len];



	        int[] tempDes=newint[len];



	        int[] tempCais=newint[len];



	        for(inti = 0; i < len; i++) {



	            tempTotals[i]=totals[index[i]];



	            tempIds[i]=ids[index[i]];



	            tempDes[i]=des[index[i]];



	            tempCais[i]=cais[index[i]];



	        }



	         



	        inttemp=0;



	        for(inti = len-1; i > 0; i--) {



	            for(intj = 0; j < i; j++) {



	                booleanflag=false;



	                if(tempTotals[j]<tempTotals[j+1]){



	                    flag=true;



	                }



	                elseif(tempTotals[j]==tempTotals[j+1]){



	                    if(tempDes[j]<tempDes[j+1]){



	                        flag=true;



	                    }



	                    elseif(tempDes[j]==tempDes[j+1]){



	                        if(tempIds[j]>tempIds[j+1]){



	                            flag=true;



	                        }



	                    }



	                }



	                 



	                if(flag){                  



	                    temp=index[j];



	                    index[j]=index[j+1];



	                    index[j+1]=temp;



	                     



	                    temp=tempTotals[j];



	                    tempTotals[j]=tempTotals[j+1];



	                    tempTotals[j+1]=temp;



	                     



	                    temp=tempIds[j];



	                    tempIds[j]=tempIds[j+1];



	                    tempIds[j+1]=temp;



	                     



	                    temp=tempDes[j];



	                    tempDes[j]=tempDes[j+1];



	                    tempDes[j+1]=temp;



	                     



	                    temp=tempCais[j];



	                    tempCais[j]=tempCais[j+1];



	                    tempCais[j+1]=temp;



	                }



	            }



	        }



	    }



	}

//难度倒是还好，处处是坑还没办法手动测试啊哭……
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;
using std::vector;
  
struct S{
    string num;
    int de;
    int cai;
    int total;
};
typedef S stu;
 
bool cmp(stu a, stu 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.num < b.num;
}
int main(){
    int N, L, H, cnt = 0;
    vector<stu> lev[4];
    stu t;
    cin >> N >> L >> H;
    for(int i = 0; i < N; i++){
        cin >> t.num >> t.de >> t.cai;
        t.total = t.de + t.cai;
        if(t.de >= H && t.cai >= H)             lev[0].push_back(t);
        else if(t.de >= H && t.cai >= L)      lev[1].push_back(t);
        else if(t.de >= t.cai && t.cai >= L)  lev[2].push_back(t);
        else if(t.de >= L && t.cai >= L)      lev[3].push_back(t);
        else;
        if(t.de >= L && t.cai >= L)       cnt++;
    }
    for(int i = 0; i < 4; i++)
        sort(lev[i].begin(), lev[i].end(), cmp);
    cout << cnt << endl;
    for(int i = 0; i < 4; i++)
        for(int j = 0; j < lev[i].size(); j++)
            cout << lev[i][j].num << " " << lev[i][j].de << " " << lev[i][j].cai << endl;           
    return 0;
}

//冒泡排序，性能不佳
#include<stdio.h>
#include<stdlib.h>
typedef struct{
	long id0;
	int score1;
	int score2;
} Student;
void BubbleSort(Student list[], int n){
	int i,j,s1,s2,temp;
	long temp2;
	if(n>1){
	  for(i=0;i<n-1;i++)
	    for(j=0;j<n-i-1;j++){
	    	s1=list[j].score1+list[j].score2;
	    	s2=list[j+1].score1+list[j+1].score2;
    		if(s1<s2 || s1==s2&&list[j].score1<list[j+1].score1 || s1==s2&&list[j].score1==list[j+1].score1 && list[j].id0>list[j+1].id0){
    			temp2=list[j].id0; list[j].id0=list[j+1].id0; list[j+1].id0=temp2;
    			temp=list[j].score1; list[j].score1=list[j+1].score1; list[j+1].score1=temp;
		    	temp=list[j].score2; list[j].score2=list[j+1].score2; list[j+1].score2=temp;}
    	}
	}
}
void printList(Student list[], int n){
	 int i;
	 for(i=0;i<n;i++)
	     printf("%ld %d %d\n",list[i].id0,list[i].score1,list[i].score2);
} 
int main(){
	Student *List;
	Student *list1,*list2,*list3,*list4;
	int n,L,H;
	int i,i1,i2,i3,i4,Count1,Count2,Count3,Count4;
	int *Label;
	scanf("%d %d %d",&n,&L,&H);
	List=(Student *)malloc(n*sizeof(Student));
	Label=(int *)malloc(n*sizeof(int));
	Count1=Count2=Count3=Count4=0;
	for(i=0;i<n;i++){
		scanf("%ld %d %d",&List[i].id0,&List[i].score1,&List[i].score2);
		if(List[i].score1<L || List[i].score2<L){
		   Label[i]=-1;
		}else{
		  if(List[i].score1>=H && List[i].score2>=H){
		     Label[i]=1;Count1++;}
          else if(List[i].score1>=H && List[i].score2<H){
          	       Label[i]=2;Count2++;}
          else if(List[i].score1<H && List[i].score2<H && List[i].score1>=List[i].score2){
          	       Label[i]=3;Count3++;}
          else{Label[i]=4;Count4++;}
		}
	}

	list1=(Student *)malloc(Count1*sizeof(Student));
	list2=(Student *)malloc(Count2*sizeof(Student));
	list3=(Student *)malloc(Count3*sizeof(Student));
	list4=(Student *)malloc(Count4*sizeof(Student));
	i1=i2=i3=i4=0;
	for(i=0;i<n;i++){
		if(Label[i]==1){
		   list1[i1].id0=List[i].id0;
		   list1[i1].score1=List[i].score1;
		   list1[i1++].score2=List[i].score2;}
        else if(Label[i]==2){
        	list2[i2].id0=List[i].id0;
		    list2[i2].score1=List[i].score1;
		    list2[i2++].score2=List[i].score2;
           }
        else if(Label[i]==3){
        	list3[i3].id0=List[i].id0;
		    list3[i3].score1=List[i].score1;
		    list3[i3++].score2=List[i].score2;
           }
         else if(Label[i]==4){
        	list4[i4].id0=List[i].id0;
		    list4[i4].score1=List[i].score1;
		    list4[i4++].score2=List[i].score2;
           }
	}

	if(Count1 > 0){
	  BubbleSort(list1,Count1);
	  printList(list1,Count1);}
    if(Count2 > 0){
	  BubbleSort(list2,Count2);
	  printList(list2,Count2);}
    if(Count3 > 0){
	  BubbleSort(list3,Count3);
	  printList(list3,Count3);}
    if(Count4 > 0){
	  BubbleSort(list4,Count4);
	  printList(list4,Count4);}

}

lst = list(map(int,input().split()))
num, l, h = lst[0],lst[1],lst[2]
alst,l1,l2,l3,l4,l5 = [],[],[],[],[],[] for j in range(num):
    alst.append(list(map(int,input().split()))) for i in range(num):  if alst[i][1] >= h and alst[i][2] >= h:
        l1.append(alst[i])  elif alst[i][1] >= h and alst[i][2] < h and alst[i][2] >= l:
        l2.append(alst[i])  elif alst[i][1] < h and alst[i][2] < h and alst[i][1] >= alst[i][2] and alst[i][1] >= l and alst[i][2] >= l:
        l3.append(alst[i])  elif alst[i][1] >= l and alst[i][2] >= l and alst[i][1] < h:
        l4.append(alst[i]) else:l5.append(alst[i])
l1.sort(key=lambda x:((-x[1]-x[2],-x[1],x[0])))
l2.sort(key=lambda x:((-x[1]-x[2],-x[1],x[0])))
l3.sort(key=lambda x:((-x[1]-x[2],-x[1],x[0])))
l4.sort(key=lambda x:((-x[1]-x[2],-x[1],x[0])))
l5.sort(key=lambda x:((-x[1]-x[2],-x[1],x[0])))
li = l1+l2+l3+l4+l5 print(num-len(l5),end='\n') for t in range(num-len(l5)):  print("%d %d %d"%(li[t][0],li[t][1],li[t][2]),end='\n')

#include <iostream>
#include <set>

using namespace std;

class Student
{
public:
    int id, morality, ability, sum, level;
    Student(int id, int morality, int ability) {
        this->id = id;
        this->morality = morality;
        this->ability = ability;
        this->sum = morality + ability;
        level = 4;//默认为第4等级，可改
    }
    bool operator <(const Student& another)const {
        if(level != another.level) {
            return level>another.level;
        } else if(sum != another.sum) {
            return another.sum>sum;
        } else if(morality != another.morality) {
            return another.morality>morality;
        } else {
            return id>another.id;
        }
    }
};

int main()
{
    // 基本变量
    int N, L, H;
    cin >> N >> L >> H;
    set<Student> student;

    // 分类划级
    for(int i=0; i<N; i++) {
        int id, morality, ability;
        cin >> id >> morality >> ability;
        Student stu(id, morality, ability);
        if(stu.morality<L || stu.ability<L) {
            continue;
        } else if(stu.morality >= H && stu.ability >= H) {
            stu.level = 1;
        } else if(stu.morality >= H) {
            stu.level = 2;
        } else if(morality>=ability) {
            stu.level = 3;
        } else {
            stu.level = 4;
        }
        student.insert(stu);
    }

    // 输出结果
    set<Student>::reverse_iterator iter;
    cout << student.size() << endl;
    for(iter=student.rbegin(); iter != student.rend(); iter++) {
        cout << (*iter).id << " " << (*iter).morality << " " << (*iter).ability << endl;
    }
    return 0;
} 

#include <cstdio>
#include <algorithm>
using namespace std;
struct student{
    int id;
    int de,cai,sum;
    int rank;
}s[100010];

bool cmp(student a,student b){
    if(a.rank!=b.rank) return a.rank<b.rank;
    else if(a.sum!=b.sum) return a.sum>b.sum;
    else if(a.de!=b.de) return a.de>b.de;
    else return a.id<b.id;
}
int main(int argc, char *argv[]){
    int n,l,h,num;
    scanf("%d%d%d",&n,&l,&h);
    num=n;
    for(int i=0;i<n;i++){
        scanf("%d%d%d",&s[i].id,&s[i].de,&s[i].cai);
        s[i].sum=s[i].de+s[i].cai;
        if(s[i].de<l ||s[i].cai<l){
            num--;
            s[i].rank=5;
        }
        else{
            if(s[i].de>=h && s[i].cai>=h) s[i].rank=1;
            else if(s[i].de>=h && s[i].cai<h) s[i].rank=2;
            else if(s[i].de>=s[i].cai) s[i].rank=3;
            else s[i].rank=4;
        }
    }
    sort(s,s+n,cmp);
    printf("%d\n",num);
    for(int i=0;i<num;i++)
        printf("%d %d %d\n",s[i].id,s[i].de,s[i].cai);

    return 0;
}

	

利用BST保存有序数据集，直接输出免排序。
import java.util.Scanner;
import java.util.TreeSet;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int L = sc.nextInt();
		int H = sc.nextInt();
		
		TreeSet<Stu> both = new TreeSet<Stu>();
		TreeSet<Stu> dc1 = new TreeSet<Stu>();
		TreeSet<Stu> dc2 = new TreeSet<Stu>();
		TreeSet<Stu> dc3 = new TreeSet<Stu>();
		while(n != 0){
			Stu stu = new Stu(sc.nextInt(), sc.nextInt(), sc.nextInt());
			if(stu.d < L || stu.c <L){
				n--;
				continue;
			}
			if(stu.d >= H && stu.c >= H)
				both.add(stu);
			else if(stu.d >= H)
				dc1.add(stu);
			else if(stu.d >= stu.c)
				dc2.add(stu);
			else
				dc3.add(stu);
			n--;
		}
		System.out.println(both.size()+dc1.size()+dc2.size()+dc3.size());
		print(both);
		print(dc1);
		print(dc2);
		print(dc3);
		sc.close();
		
	}
	
	private static void print(TreeSet<Stu> set) {
		for(Stu s : set)
			System.out.println(s.id + " " + s.d + " " + s.c);
	}

	static class Stu implements Comparable<Stu>{
		int id, d, c, sum;
		public Stu(int id, int d, int c) {
			this.id = id;
			this.d = d;
			this.c = c;
			this.sum = d+c;
		}
		@Override
		public int compareTo(Stu o) {
			if(this.sum != o.sum)
				return o.sum-this.sum;
			if(this.d != o.d)
				return o.d-this.d;
			return this.id-o.id;
		}
		
	}
	
}

struct student{
	int no, a, b, sum, level;
	bool operator<(const student& l)const 
	{
		if (level != l.level)
			return level > l.level;
		else if (sum != l.sum)
			return sum < l.sum;
		else if (a != l.a)
			return l.a>a;
		else
			return no > l.no;
	}
};
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
	int n, l, h, cnt = 0, no, a, b, sum;
	vector<student>  vs;
	cin >> n >> l >> h;
	for (int i = 0; i != n;i++)
	{
		cin >> no >> a >> b;
		sum = a + b;
		if (a < l || b < l)
		{
			cnt++;
			continue;
		}
		else if (a >= h&&b >= h)
		{
			vs.push_back({ no,a,b,sum,1 });
		}
		else if (a >= h)
		{
			vs.push_back({ no,a,b,sum,2 });
		}
		else if (a >= b)
		{
			vs.push_back({ no,a,b,sum,3 });
		}
		else {
			vs.push_back({ no,a,b,sum,4 });
		}
	}
	sort(vs.begin(), vs.end());
	cout << n - cnt << endl;
	for (auto it = vs.rbegin(); it != vs.rend(); it++)
		cout << it->no << " " << it->a << " " << it->b << endl;
	return 0;
}