Problem:
Book Index

Books are indexed. Write a program which reads a list of pairs of a word and a page number, and prints the word and a list of the corresponding page numbers.

You can assume that a word consists of at most 30 characters, and the page number is less than or equal to 1000. The number of pairs of a word and a page number is less than or equal to 100. A word never appear in a page more than once.

The words should be printed in alphabetical order and the page numbers should be printed in ascending order.

Input

word page_number
:
:

Output

word
a_list_of_the_page_number
word
a_list_of_the_Page_number
:
:

Sample Input

style 12
even 25
introduction 3
easy 9
style 7
document 13
style 21
even 18

Output for the Sample Input

document
13
easy
9
even
18 25
introduction
3
style
7 12 21

Solution in JAVA (judge verdict: Wrong Answer)

import java.util.PriorityQueue;
import java.util.Scanner;

public class Main {
	
	static class Dic implements Comparable<Dic>{
		String moji;
		int page;
		Dic(String moji, int page){
			this.moji=moji;
			this.page=page;
		}
		public int compareTo(Dic d) {
			if(this.moji==d.moji) {
				return this.page-d.page;
			}
			else {
				return this.moji.compareTo(d.moji);
			}
		}
	}
	
	public static void main(String[] args) {
		try(Scanner sc = new Scanner(System.in)){
			PriorityQueue<Dic> pq=new PriorityQueue<>();
			while(sc.hasNextLine()) {
				String str=sc.nextLine();
				String[] token=str.split(" ");
				String s=token[0];
				int n=Integer.parseInt(token[1]);
				pq.add(new Dic(s, n));
			}
			String pre="";
			while(!pq.isEmpty()) {
				Dic dic=pq.poll();
				if(dic.moji.equals(pre)) {
					System.out.println(" "+dic.page);
				}
				else if(pre.equals("")) {
					System.out.println(dic.moji);
					System.out.print(dic.page);
				}
				else {
					System.out.println();
					System.out.println(dic.moji);
					System.out.print(dic.page);
				}
				pre=dic.moji;
			}
		}
	}
}