-
Notifications
You must be signed in to change notification settings - Fork 75
Expand file tree
/
Copy pathCodeforces_0002A_Winner.java
More file actions
45 lines (44 loc) · 1.42 KB
/
Codeforces_0002A_Winner.java
File metadata and controls
45 lines (44 loc) · 1.42 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
// AC: 528 ms
// Memory: 0 KB
// Hashmap.
// T:O(sum(ni)), S:O(max(ni))
//
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Scanner;
public class Codeforces_0002A_Winner {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int t = sc.nextInt(), maxScore = 0;
HashMap<String, Integer> nameSore = new HashMap<>();
List<String> record = new LinkedList<>();
for (int i = 0; i < t; i++) {
String name = sc.next();
int score = sc.nextInt();
nameSore.merge(name, score, Integer::sum);
record.add(name + "#" + score);
}
for (String key : nameSore.keySet()) {
maxScore = Math.max(maxScore, nameSore.get(key));
}
HashSet<String> names = new HashSet<>();
for (String key : nameSore.keySet()) {
if (nameSore.get(key).equals(maxScore)) {
names.add(key);
}
}
nameSore.clear();
for (String item : record) {
String[] arr = item.split("#");
String name = arr[0];
int score = Integer.parseInt(arr[1]);
nameSore.merge(name, score, Integer::sum);
if (nameSore.get(name) >= maxScore && names.contains(name)) {
System.out.println(name);
return;
}
}
}
}