р
package com.javarush.task.task19.task1920;
/*
Самый богатый
*/
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.*;
public class Solution {
public static void main(String[] args) throws IOException {
BufferedReader reader = new BufferedReader(new FileReader(args[0]));
ArrayList<String> list = new ArrayList<>();
while (reader.ready()) {
list.add(reader.readLine());
}
reader.close();
HashMap<String, Double> map = new HashMap<>();
while (list.size() > 0) {
String[] arr = list.get(0).split(" ");
String name = arr[0];
double money = Double.parseDouble(arr[1]);
for (int i = 1; i < list.size(); i++) {
if (list.get(i).contains(name)) {
String[] subArr = list.get(i).split(" ");
money += Double.parseDouble(subArr[1]);
list.remove(i);
i--;
}
}
map.put(name, money);
list.remove(0);
}
List<Double> list1 = new ArrayList<>();
for (Map.Entry<String, Double> pair : map.entrySet()) {
list1.add(pair.getValue());
}
Collections.sort(list1);
double maxValue = list1.get(list1.size()-1);
ArrayList<String>names=new ArrayList<>();
for (Map.Entry<String, Double>pair:map.entrySet()) {
if(pair.getValue()==maxValue){
names.add(pair.getKey());
}
}
Collections.sort(names);
for (String name:names) {
System.out.println(name);
}
}
}