树集及排序

、编写程序将一组学生对象的姓名和成绩存入到一个树集（TreeSet）中，完成以下要求：

•    使得按照成绩自动降序排列，并输出排序的结果。

 

import java.util.Comparator;
import  java.util.TreeSet;

class Student{
    String name;
    int score;

public Student(String name,int score){
    this.name=name;
    this.score=score;
}
public String getName(){
    return name;
}

    public int getScore() {
        return score;
    }
    public String toString(){
    return "Student{"
            +"name="+name+",score="+score+'}';
    }

}
public class Main {
    public static void main(String[] args) {
        TreeSet<Student>treeSet=new TreeSet<>(new Comparator<Student>() {
            @Override
            public int compare(Student o1, Student o2) {
                return Integer.compare(o2.getScore(),o1.getScore());

            }
        });
        treeSet.add(new Student("Alice",90));
        treeSet.add(new Student("B0B",85));
        treeSet.add(new Student("CCc",95));
        treeSet.add(new Student("DaA",80));
        treeSet.add(new Student("Eee",92));
        System.out.println("降序:");
        for (Student student:treeSet){
            System.out.println(student);
        }
    }
}