Почему так не могу понять
package com.javarush.task.task19.task1920;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashMap;
import java.util.Map;
import java.util.TreeMap;
import java.util.TreeSet;
/*
Самый богатый
*/
public class Solution {
public static void main(String[] args) {
TreeMap<String, Double> min = new TreeMap<>();
try (BufferedReader rd = new BufferedReader(new FileReader(args[0]))) {
String[] splitedLine;
String line;
while ((line = rd.readLine()) != null) {
splitedLine = line.split(" ");
if (splitedLine.length == 2 || splitedLine.length > 1) {
String name = splitedLine[0];
double value = Double.parseDouble(splitedLine[1]);
min.put(name, value);
Map.Entry<String, Double> max = null;
for (Map.Entry<String, Double> entry : min.entrySet()) {
if (max == null || entry.getValue() < max.getValue()) {
max = entry;
}
}
}
}
} catch (IOException ignore) {
/*NOP */
}
// for (Map.Entry<String, Double> entry : min.entrySet()) {
// System.out.println(entry.getKey() );
// }
double maxSalary = min.firstEntry().getValue();
TreeSet<String> names = new TreeSet<>();
for (String name : min.keySet()) {
if (maxSalary == min.get(name)) {
names.add(name);
}
}
for (String name : names) {
System.out.println(name);
}
//
// Map<String, Double> sorted = new TreeMap<>(min);
//
// for (Map.Entry<String, Double> entry : sorted.entrySet()) {
// System.out.println(entry.getKey() + " " + entry.getValue() + " ");
// }
}
}