package com.javarush.task.task19.task1920;
/*
Самый богатый
*/
import java.util.*;
import java.io.*;
import java. util. Collection;
import java. util. Map;
import java. util. HashMap;
import java.util.TreeMap;
public class Solution {
public static void main(String[] args) throws Exception {
String fileName = args[0];
FileReader fileReader = new FileReader(fileName);
BufferedReader bufferedReader = new BufferedReader(fileReader);
Map<String, Double> map = new HashMap<>();
ArrayList <Double> sum1 = new ArrayList<>();
ArrayList <Double> sum2 = new ArrayList<>();
String str;
String name;
double d = 0.0;
while ((str = bufferedReader.readLine()) != null) {
String [] strings = str.split(" ");
name = strings[0];
d =Double.parseDouble(strings[1]);
if (map.containsKey(name)){
double dd = map.get(name);
d = dd+d;
map.put(name, d);
sum1.add(d);
}else{
map.put(name, d);}
sum1.add(d);
}
bufferedReader.close();
for (Map.Entry<String, Double> e : map.entrySet()){
sum1.add(e.getValue());
}
double max = 0.0;
for(int i = 0;i<sum1.size();i++){
if(max<sum1.get(i)){
max=sum1.get(i);
}
}
for (Map.Entry<String, Double> e : map.entrySet()){
if(e.getValue()==max){
System.out.println(e.getKey() + " " + e.getValue());
}
}
}
}
package com.javarush.task.task19.task1920;
/*
Самый богатый
*/
import java.util.*;
import java.io.*;
import java. util. Collection;
import java. util. Map;
import java. util. HashMap;
import java.util.TreeMap;
public class Solution {
public static void main(String[] args) throws Exception {
String fileName = args[0];
FileReader fileReader = new FileReader(fileName);
BufferedReader bufferedReader = new BufferedReader(fileReader);
Map<String, Double> map = new HashMap<>();
ArrayList <Double> sum1 = new ArrayList<>();
ArrayList <Double> sum2 = new ArrayList<>();
String str;
String name;
double d = 0.0;
while ((str = bufferedReader.readLine()) != null) {
String [] strings = str.split(" ");
name = strings[0];
//System.out.println(name);
d =Double.parseDouble(strings[1]);
//System.out.println(d);
if (map.containsKey(name)){
double dd = map.get(name);
d = dd+d;
//System.out.println(d);
map.put(name, d);
sum1.add(d);
}else{
map.put(name, d);}
sum1.add(d);
}
bufferedReader.close();
for (Map.Entry<String, Double> e : map.entrySet()){
sum1.add(e.getValue());
//System.out.println(e.getKey() + " " + e.getValue());
}
double max = 0.0;
for(int i = 0;i<sum1.size();i++){
if(max<sum1.get(i)){
max=sum1.get(i);
}
}
for (Map.Entry<String, Double> e : map.entrySet()){
if(e.getValue()==max){
System.out.println(e.getKey() + " " + e.getValue());
}
}
}
}