-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathComparator
More file actions
65 lines (52 loc) · 1.26 KB
/
Comparator
File metadata and controls
65 lines (52 loc) · 1.26 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
/*
Comparator interface is used to order the objects of user-defined classes.
Sample Input:
5
amy 100
david 100
heraldo 50
aakansha 75
aleksa 150
Sample Output:
aleksa 150
amy 100
david 100
aakansha 75
heraldo 50
*/
import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;
class Checker implements Comparator<Player> {
@Override
public int compare(Player a, Player b){
if (a.score == b.score)
return a.name.compareTo(b.name); // ascending (alphabetically)
else
return b.score - a.score; // descending
}
}
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);
}
}
}