javaPAT甲级1002

import java.util.Scanner;
import java.util.HashMap;
public class Main {

	private static Scanner in;
	public static void swap(int[] arr,int m,int n)
	{
		int tmp=arr[m];
		arr[m]=arr[n];
		arr[n]=tmp;
	}
	public static void buddle_sort(int[] arr)
	{
		int n=arr.length;
		for(int i=0;i<n-1;i++)
			for(int j=0;j<n-1-i;j++)
			{
				if(arr[j]>arr[j+1])
					swap(arr,j,j+1);
			}
	}
	public static void main(String[] args) {
		in = new Scanner(System.in);
		int n=in.nextInt();
		HashMap<Integer,Double> map=new HashMap<Integer,Double>();
		for(int i=0;i<n;i++)
		{
			map.put(in.nextInt(), in.nextDouble());
		}
		int m=in.nextInt();
		Integer a1;
		Double a2;
		Double tmp;
		for(int i=0;i<m;i++)
		{
			a1=in.nextInt();
			a2=in.nextDouble();
			if(map.get(a1)!=null)
			{
				tmp=map.get(a1);
				map.put(a1, a2+tmp);
			}
			else
			{
				map.put(a1, a2);
			}
		}
		int[] arr3=new int[map.size()];
		int cnt=0;
		System.out.print(map.size()+" ");
		for (Integer key : map.keySet()) {
			arr3[cnt++]=key;
		}
		buddle_sort(arr3);
		for(int i=cnt-1;i>=0;i--)
		{
			System.out.print(arr3[i]+" "+map.get(arr3[i])+" ");
		}
	}

}