Map <String,Integer> counter = new HashMap <String,Integer> (); // TODO: counter füllen class Comp<K extends Comparable, V extends Comparable> implements Comparator<Map.Entry<K,V>> { .. } // TODO: Vergleich nach V SortedSet<Map.Entry<String,Integer>> t = new TreeSet<Map.Entry<String,Integer>> (new Comp<String,Integer>()); t.addAll (counter.entrySet ()); int clock = 10; for (Map.Entry <String,Integer> e : t) { System.out.println (e); if (--clock < 0) break; }