View Code of Problem 83

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scanner=new Scanner(System.in);
		int m=scanner.nextInt();
		m=m+scanner.nextInt();
		List<Student> list=new ArrayList<Main.Student>();
		for (int i = 0; i < m; i++) {
			Student student=new Student();
			student.id=scanner.nextInt();
			student.grade=scanner.nextInt();
			list.add(student);
		}
		Collections.sort(list,new Comparator<Student>() {

			@Override
			public int compare(Student o1, Student o2) {
				// TODO Auto-generated method stub
				if (o1.id>o2.id) {
					return 1;
				}else if (o1.id<o2.id) {
					return -1;
				}
				return 0;
			}
		});
		for (int i = 0; i < list.size(); i++) {
			System.out.println(list.get(i).id+" "+list.get(i).grade);
		}
	}
	static class  Student {
		public int id;
		public int grade;
	}
}