Java Sort

윤지현·2025년 4월 4일
0

HackerRank[Java]

목록 보기
33/57
  • 문제
  • 정답
import java.util.*;

class Student{
	private int id;
	private String fname;
	private double cgpa;
	public Student(int id, String fname, double cgpa) {
		super();
		this.id = id;
		this.fname = fname;
		this.cgpa = cgpa;
	}
	public int getId() {
		return id;
	}
	public String getFname() {
		return fname;
	}
	public double getCgpa() {
		return cgpa;
	}
}

//Complete the code
public class Solution
{
	public static void main(String[] args){
		Scanner in = new Scanner(System.in);
		int testCases = Integer.parseInt(in.nextLine());
		
		List<Student> studentList = new ArrayList<Student>();
		while(testCases>0){
			int id = in.nextInt();
			String fname = in.next();
			double cgpa = in.nextDouble();
			
			Student st = new Student(id, fname, cgpa);
			studentList.add(st);
			
			testCases--;
		}
        
        Collections.sort(studentList, Comparator
            .comparing(Student::getCgpa, Comparator.reverseOrder())
            .thenComparing(Student::getFname)
            .thenComparingInt(Student::getId));
      
      	for(Student st: studentList){
			System.out.println(st.getFname());
		}
	}
}
  • 결과
profile
첫 시작

0개의 댓글