View difference between Paste ID: mPUwnpL0 and Y6hWppjx
SHOW: | | - or go back to the newest paste.
1
package _2_1JUNE;
2
3
import java.util.Scanner;
4
import java.util.TreeMap;
5
6
public class _4_LogsAggregator {
7
	public static void main(String[] args) {
8
		
9
		Scanner sc = new Scanner (System.in);
10
		int n = sc.nextInt();
11
		sc.nextLine();
12
		TreeMap<String, TreeMap<String, Integer>> logs = new TreeMap<>();
13
14
		for (int i = 0; i < n; i++) {
15
			String[] input = sc.nextLine().split(" ");
16
			
17
			String ip = input[0];
18
			
19
			
20
			String name = input[1];
21
			int dur = Integer.parseInt(input[2]);
22
			if (!logs.containsKey(name)) {
23
				logs.put(name, new TreeMap<>());
24
				logs.get(name).put(ip, dur);
25
26
			}
27
			else  {
28
				if ((!logs.get(name).containsKey(ip))) {
29
					logs.get(name).put(ip, dur);
30
				}
31
				else {
32
					
33
				}
34
			}						
35
		}
36
		
37
		int sum=0;
38
39
		for (String name : logs.keySet()) { 
40
			System.out.print(name + ": "); // Loop by key and print it			
41
			
42
			for (int dur : logs.get(name).values()) { 
43
				sum += dur;
44
			}
45
			System.out.print(sum+" ");
46
			System.out.println(logs.get(name).keySet()); // print keys of inner map (names)
47
48
		}									
49
	}
50
}