ΠΡΠΎΠ²Π΅ΡΡΠ» Π½Π° ΠΏΡΠΈΠΌΠ΅ΡΠ°Ρ
, Π²ΡΠ΅ Π½ΠΎΡΠΌΠ°Π»ΡΠ½ΠΎ Π²ΡΠ²ΠΎΠ΄ΠΈΠ»ΠΎΡΡ. ΠΠΎΠΆΠ΅Ρ ΠΊΠ°ΠΊΠΎΠΉ-ΡΠΎ Π²Π°ΡΠΈΠ°Π½Ρ Π½Π΅ ΡΡΠΈΡΡΠ²Π°Ρ ΠΈΠ»ΠΈ Π½Π΅Π΄ΠΎΠΏΠΎΠ½ΠΈΠΌΠ°Ρ ΡΡΠ»ΠΎΠ²ΠΈΠ΅ Π·Π°Π΄Π°ΡΠΈ.
package com.javarush.task.task19.task1920;
/*
Π‘Π°ΠΌΡΠΉ Π±ΠΎΠ³Π°ΡΡΠΉ
*/
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.TreeMap;
import java.util.Map;
public class Solution {
public static void main(String[] args) throws IOException {
BufferedReader reader = new BufferedReader(new FileReader(args[0]));
TreeMap<String, Double> nameMap = new TreeMap<>();
double max = Double.MIN_VALUE;
String s;
while((s = reader.readLine()) != null) {
String[] str = s.split("\\s");
if(!nameMap.containsKey(str[0])) {
nameMap.put(str[0], Double.parseDouble(str[1]));
}
else {
for(Map.Entry<String, Double> pair : nameMap.entrySet()) {
if(pair.getKey().equals(str[0])) {
double d = pair.getValue() + Double.parseDouble(str[1]);
nameMap.put(str[0], d);
if(d > max) max = d;
}
}
}
}
for(Map.Entry<String, Double> pair : nameMap.entrySet()) {
if(pair.getValue().equals(max)) System.out.println(pair.getKey());
}
reader.close();
}
}