Submission #1179552

---

Source Code Expand

import java.util.*;

public class Main {
	static final Scanner s = new Scanner(System.in);
	public static void main(String args[]){
		int n=s.nextInt();
		Counter<String> c = new Counter<>(n);
		for(int i=0;i<n;i++)
			c.add(s.next());
		System.out.println(
				c.map.entrySet().stream()
				.max((o1,o2)->o1.getValue()-o2.getValue())
				.get()
				.getKey()
				);
	}
}
class Counter<T> {
	public HashMap<T, Integer> map;
	public Counter(int initSize) {
		map = new HashMap<>(initSize);
	}
	public Counter() {
		this(10);
	}
	public void add(T key, int v) {
		Integer i;
		if((i=map.get(key))==null) {
			map.put(key, v);
		}else {
			map.put(key, i+v);
		}
	}
	public void add(T key) {
		add(key,1);
	}
}

Submission Info

Judge Result