package com.javarush.task.task19.task1920;
/*
Самый богатый
*/
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class Solution {
public static void main(String[] args) throws IOException {
//BufferedReader file = new BufferedReader(new FileReader(args[0]));
BufferedReader file = new BufferedReader(new FileReader("D:\\projects\\java\\JavaRushTasks\\2.JavaCore\\src\\com\\javarush\\task\\task19\\task1919\\1.txt"));
Map<String, Double> map = new HashMap<>();
double max = 0;
while(file.ready()){
String str = file.readLine();
String name = str.split(" ")[0];
Double value = Double.parseDouble(str.split(" ")[1]);
if(value > max) max = value;
boolean t = false;
for(Map.Entry<String, Double> pair : map.entrySet()){
if(name.equals(pair.getKey())){
if(pair.getValue() + value > max) max = pair.getValue() + value;
map.put(name, pair.getValue() + value);
t = true;
}
}
if(!t) map.put(name, value);
}
file.close();
List<String> list = new ArrayList<>();
TreeMap<String, Double> sortedMap = new TreeMap<>(map);
for(Map.Entry<String, Double> pair : sortedMap.entrySet()){
if(pair.getValue().equals(max)) list.add(pair.getKey());
}
Collections.sort(list);
for(String s : list) System.out.println(s);
}
}
package com.javarush.task.task19.task1920;
/*
Самый богатый
*/
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class Solution {
public static void main(String[] args) throws IOException {
BufferedReader file = new BufferedReader(new FileReader(args[0]));
//BufferedReader file = new BufferedReader(new FileReader("D:\\projects\\java\\JavaRushTasks\\2.JavaCore\\src\\com\\javarush\\task\\task19\\task1919\\1.txt"));
Map<String, Double> map = new HashMap<>();
double max = 0;
while(file.ready()){
String str = file.readLine();
String name = str.split(" ")[0];
Double value = Double.parseDouble(str.split(" ")[1]);
if(value > max) max = value;
boolean t = false;
for(Map.Entry<String, Double> pair : map.entrySet()){
if(name.equals(pair.getKey())){
if(pair.getValue() + value > max) max = pair.getValue() + value;
map.put(name, pair.getValue() + value);
t = true;
}
}
if(!t) map.put(name, value);
}
file.close();
List<String> list = new ArrayList<>();
TreeMap<String, Double> sortedMap = new TreeMap<>(map);
for(Map.Entry<String, Double> pair : sortedMap.entrySet()){
if(pair.getValue().equals(max)) list.add(pair.getKey());
}
Collections.sort(list);
for(String s : list) System.out.println(s);
}
}