Codeforces 2A. Winner

【题目来源】：点击打开链接

【题目描述】：The winner of the card game popular in Berland "Berlogging" is determined according to the following rules. If at the end of the game there is only one player with the maximum number of points, he is the winner. The situation becomes more difficult if the number of such players is more than one. During each round a player gains or loses a particular number of points. In the course of the game the number of points is registered in the line "name score", where name is a player's name, and score is the number of points gained in this round, which is an integer number. If score is negative, this means that the player has lost in the round. So, if two or more players have the maximum number of points (say, it equals to m) at the end of the game, than wins the one of them who scored at least m points first. Initially each player has 0 points. It's guaranteed that at the end of the game at least one player has a positive number of points.

Input

The first line contains an integer number n (1  ≤  n  ≤  1000), n is the number of rounds played. Then follow n lines, containing the information about the rounds in "name score" format in chronological order, where name is a string of lower-case Latin letters with the length from 1 to 32, and score is an integer number between -1000 and 1000, inclusive.

Output

Print the name of the winner.

Examples

input

Copy

3
mike 3
andrew 5
mike 2

output

Copy

andrew

input

Copy

3
andrew 3
andrew 2
mike 5

output

Copy

andrew

【题目分析】：此题求出现与姓名相对应的数字之和最大的姓名，如果有多个相同的最大值，则先输出最先到达最大值的姓名。

java中map接口：

• 给定一个键和一个值，你可以将该值存储在一个Map对象. 之后，你可以通过键来访问对应的值。

【AC代码】：

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		String name[] = new String[1000];
		int score[] = new int[1000];
		Map<String, Integer> m1 = new HashMap<String, Integer>();
		for (int i = 0; i < n; i++) {
			name[i] = sc.next();
			score[i] = sc.nextInt();
			if (m1.containsKey(name[i])) {//判断字符是否出现过
				m1.put(name[i], m1.get(name[i]) + score[i]);
			} else {
				m1.put(name[i], score[i]);
			}
		}
		int max=-10000;
		/**计算最高分*/
		for(int i=0;i<n;i++)
		{
			if(m1.get(name[i])>max)
				max=m1.get(name[i]);
		}
		/**判断谁先到达最高分*/
		Map<String, Integer> m2 = new HashMap<String, Integer>();
		 for(int i=0;i<n;i++)
		{
			 if(m1.get(name[i])==max)
			 {
					if (m2.containsKey(name[i])) {//判断字符是否出现过
						m2.put(name[i], m2.get(name[i]) + score[i]);
					} else {
						m2.put(name[i], score[i]);
					}
					if(m2.get(name[i])>=max)
					{
						System.out.println(name[i]);
						break;
					}		
			 }
		}
	}
}