не пойму где я не прав.
package com.javarush.task.task19.task1920;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.Map;
import java.util.TreeMap;
/*
Самый богатый
*/
public class Solution {
public static void main(String[] args) throws IOException {
// String[] arg = {"C:/1/in.txt"};
// args = arg;
Map<String, Double> list = new TreeMap();
BufferedReader fileRead = new BufferedReader(new FileReader(args[0]));
Double max = 0.0;
int i = 0;
while (fileRead.ready()) {
String[] word = fileRead.readLine().split(" ", 2);
if (i == 0) {
max = Double.parseDouble(word[1]);
i = 1;
}
else if (max < Double.parseDouble(word[1]))
max = Double.parseDouble(word[1]);
if (!list.containsKey(word[0]))
list.put(word[0], Double.parseDouble(word[1]));
else {
Double val = list.get(word[0]);
list.put(word[0], (val + Double.parseDouble(word[1])));
}
}
fileRead.close();
for (Map.Entry<String, Double> pair : list.entrySet()) {
if (max.doubleValue() == pair.getValue().doubleValue())
System.out.println(pair.getKey());
}
}
}