-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathComparator.java
More file actions
74 lines (64 loc) · 2.24 KB
/
Comparator.java
File metadata and controls
74 lines (64 loc) · 2.24 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
66
67
68
69
70
71
72
73
74
/*Comparators are used to compare two objects. In this challenge, you'll create a comparator and use it to sort an array.
The Player class is provided for you in your editor. It has fields: a String and a integer.
Given an array of Player objects, write a comparator that sorts them in order of decreasing score;
if or more players have the same score, sort those players alphabetically by name.
To do this, you must create a Checker class that implements the Comparator interface,
then write an int compare(Player a, Player b) method implementing the Comparator.compare(T o1, T o2) method.
Input Format
Input from stdin is handled by the locked stub code in the Solution class.
The first line contains an integer, , denoting the number of players.
Each of the subsequent lines contains a player's and , respectively.
Constraints
players can have the same name.
Player names consist of lowercase English letters.
Output Format
You are not responsible for printing any output to stdout. The locked stub code in Solution
will create a Checker object, use it to sort the Player array, and print each sorted element.
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.*;
import java.util.Comparator;
class Checker implements Comparator<Player> {
@Override
public int compare(Player o1, Player o2) {
if((o2.score-o1.score)==0) return o1.name.compareTo(o2.name);//alphabetically
else{
return o2.score-o1.score;//decreasing
}
}
}
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);
}
}
}