Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.*;
- public class Task1100 {
- public static void main(String[] args) {
- Scanner scanner = new Scanner(System.in);
- int nTeams = Integer.parseInt(scanner.nextLine());
- LinkedHashMap<Integer, Byte> map = new LinkedHashMap<>();
- for (int i = 0; i < nTeams; i++) {
- int teamNumber = scanner.nextInt();
- byte score = scanner.nextByte();
- map.put(teamNumber, score);
- }
- sortByValue(map);
- for (Integer key : map.keySet()) {
- System.out.printf("%d %d\n", key, map.get(key));
- }
- }
- public static void sortByValue(LinkedHashMap<Integer, Byte> elements) {
- LinkedHashMap<Integer, Byte> result = new LinkedHashMap<>();
- Set<Map.Entry<Integer, Byte>> entries = elements.entrySet();
- List<Map.Entry<Integer, Byte>> listOfEntries = new ArrayList<>(entries);
- Comparator<Map.Entry<Integer, Byte>> comparator = new Comparator<Map.Entry<Integer, Byte>>() {
- @Override
- public int compare(Map.Entry<Integer, Byte> e1, Map.Entry<Integer, Byte> e2) {
- return e2.getValue().compareTo(e1.getValue());
- }
- };
- Collections.sort(listOfEntries, comparator);
- for (Map.Entry<Integer, Byte> entry : listOfEntries) {
- result.put(entry.getKey(), entry.getValue());
- }
- elements.clear();
- for (Integer key : result.keySet()) {
- elements.put(key, result.get(key));
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement