Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.LinkedHashMap;
- import java.util.Map;
- import java.util.Scanner;
- import java.util.TreeMap;
- public class _Problem04 {
- public static void main(String[] args) {
- Scanner sc = new Scanner(System.in);
- int count = sc.nextInt();
- sc.nextLine();
- Map<String, Map<Integer, String>> users = new LinkedHashMap<String, Map<Integer, String>>();
- for (int i = 0; i < count; i++) {
- String logs = sc.nextLine();
- String[] logsToArr = logs.split(" ");
- if (users.get(logsToArr[1]) == null) {
- users.put(logsToArr[1], new TreeMap<>());
- users.get(logsToArr[1]).put(Integer.parseInt(logsToArr[2]), logsToArr[0]);
- }else {
- users.get(logsToArr[1]).put(Integer.parseInt(logsToArr[2]), logsToArr[0]);
- }
- }
- for (Map.Entry<String, Map<Integer, String>> user : users.entrySet()) {
- String output = "";
- String bracket = "]";
- output += user.getKey() + ": ";
- for (Map.Entry<Integer, String> log : user.getValue().entrySet()) {
- output += log.getKey() + " [" + log.getValue();
- output += ", ";
- }
- output = output.substring(0, output.length() - 2);
- System.out.println(output + bracket);
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement