solution.java

// https://github.com/Utkarsh299-tech

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;
	}
}

class StudentComparator implements Comparator<Student> {
 double epsilon = 0.001; // since we shouldn't use '==' with doubles
 @Override
 public int compare(Student s1, Student s2) {
 if(Math.abs(s1.getCgpa() - s2.getCgpa()) > epsilon) {
 return s1.getCgpa() < s2.getCgpa() ? 1 : -1; // descending order
 } else if (!s1.getFname().equals(s2.getFname())) {
 return s1.getFname().compareTo(s2.getFname());
 } else {
 return s1.getId() - s2.getId();
 }
 }
}

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, new StudentComparator());
 	for(Student st: studentList){
			System.out.println(st.getFname());
		}
	}
}