.
package com.codegym.task.task19.task1920;
/*
The richest
*/
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.Map;
import java.util.TreeMap;
public class Solution {
public static void main(String[] args) throws IOException {
// BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
// String s = bf.readLine();
BufferedReader reader = new BufferedReader(new FileReader(args[0]));
Map<String, Double> map = new TreeMap<>();
double max = 0;
while (reader.ready()) {
String n = reader.readLine();
int start = n.indexOf(n.charAt(0));
int end = n.indexOf(' ');
String name = n.substring(start, end);
int start2 = n.indexOf(' ');
String salary = n.substring(start2 + 1);
double doubleSalary = Double.parseDouble(salary);
if (map.containsKey(name)) {
map.replace(name, map.get(name) + doubleSalary);
} else {
map.put(name, doubleSalary);
}
if (doubleSalary > max) {
max = doubleSalary;
}
}
for (Map.Entry<String, Double> entry : map.entrySet()) {
if (entry.getValue() == max) {
System.out.println(entry.getKey());
}
}
reader.close();
}
}