-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathComparator.java
More file actions
60 lines (48 loc) · 1.25 KB
/
Comparator.java
File metadata and controls
60 lines (48 loc) · 1.25 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
/*
Implementing the comparator interface
Input format
5 //Number of players
amy 100 //Name and scores of the Players
david 100
heraldo 50
aakansha 75
aleksa 150
Output: should be sorted list of players,
if two players have same score they
should be sorted by name alphabetically.
*/
import java.util.*;
class Checker implements Comparator<Player>{
String name;
int score;
public int compare(Player a, Player b){
if(a.score == b.score){
return a.name.compareTo(b.name);
}
return b.score-a.score;
}
}
class Player{
String name;
int score;
Player(String name, int score){
this.name = name;
this.score = score;
}
}
public class Comparator {
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);
}
}
}