Sort by

recency

|

276 Discussions

|

  • + 0 comments
    import java.util.*;
    
    class Checker implements Comparator<Player> {
        @Override
        public int compare(Player o1, Player o2) {
            if (o1.score != o2.score) {
                return o2.score - o1.score;
            } else {
                return o1.name.compareTo(o2.name);
            }
        }
    }
    
    class Player{
        String name;
        int score;
        
        Player(String name, int score){
            this.name = name;
            this.score = score;
        }
    }
    
    class Solution {
    
        public static void main(String[] args) {
            Scanner scan = new Scanner(System.in);
            int n = scan.nextInt();
    
            Player[] player = new Player[n];
            Checker checker = new Checker();
            
            for(int i = 0; i < n; i++){
                player[i] = new Player(scan.next(), scan.nextInt());
            }
            scan.close();
    
            Arrays.sort(player, checker);
            for(int i = 0; i < player.length; i++){
                System.out.printf("%s %s\n", player[i].name, player[i].score);
            }
        }
    }
    
  • + 0 comments

    import java.util.*;

    // Player class class Player { String name; int score;

    Player(String name, int score) {
        this.name = name;
        this.score = score;
    }
    

    }

    // Checker class that implements Comparator class Checker implements Comparator { public int compare(Player a, Player b) { // First sort by descending score if (a.score != b.score) { return b.score - a.score; // higher score comes first } // If scores are equal, sort alphabetically by name return a.name.compareTo(b.name); } }

    public class Solution { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int n = scanner.nextInt();

        Player[] players = new Player[n];
    
        for (int i = 0; i < n; i++) {
            String name = scanner.next();
            int score = scanner.nextInt();
            players[i] = new Player(name, score);
        }
    
        scanner.close();
    
        // Use custom comparator to sort
        Arrays.sort(players, new Checker());
    
        // Print sorted result
        for (Player p : players) {
            System.out.println(p.name + " " + p.score);
        }
    }
    

    }

  • + 0 comments

    class Checker implements Comparator { Comparator comp = (p1, p2) -> Integer.valueOf(p2.score).compareTo(Integer.valueOf(p1.score)); @Override public int compare(Player o1, Player o2) { return comp.thenComparing((p1,p2) -> p1.name.compareTo(p2.name)).compare(o1, o2); } }

  • + 0 comments

    Here is Java Comparator solution - https://programmingoneonone.com/hackerrank-java-comparator-problem-solution.html

  • + 0 comments
       public static class Student {
            String name;
            int marks;
    
            public Student(String name, int marks) {
                this.name = name;
                this.marks = marks;
            }
    
            @Override
            public String toString() {
                return ""+ name + " " + marks + "";
            }
        }
    
        public static class SortByName implements Comparator<Student> {
            @Override
            public int compare(Student o1, Student o2) {
                return o1.marks==o2.marks ? o1.name.compareTo(o2.name) : o2.marks-o1.marks;
            }
    
        }
    
        public static void main(String[] args) {
            Scanner scanner = new Scanner(System.in);
            ArrayList<Student> list = new ArrayList<Student>();
            int size = scanner.nextInt();
            for(int i=0; i<size; i++){
                list.add(new Student(scanner.next(), scanner.nextInt()));
            }
            scanner.close();
            list.sort(new SortByName());
            list.stream().forEach(System.out::println);
        }