pat1009

package AdvancedLevelPractice;

import java.util.Iterator;
import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;


public class pat1009{
	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner scanner = new Scanner(System.in);
		
		int n1 = scanner.nextInt();
		int[] exp = new int[n1];
		double[] coff = new double[n1];
		
		for(int i = 0; i < n1; i++){
			exp[i] = scanner.nextInt();
			coff[i] = scanner.nextDouble();
		}
		int n2 = scanner.nextInt();

		Map results = new TreeMap().descendingMap();
		int exp1, exp2;
		double coff1, coff2;
		int count = 0;
		for(int i = 0; i < n2; i++){
			exp1 = scanner.nextInt();
			coff1 = scanner.nextDouble();
			
			for(int j = 0; j < n1; j++){
				exp2 = exp1 + exp[j];
				coff2 = coff1 * coff[j];
				
				if(results.containsKey(exp2)){
					coff2 += Double.parseDouble(String.valueOf(results.get(exp2)));
					results.remove(exp2);
					count--;
				}
				
				if(!String.format("%.1f",coff2).contains("0.0")){
					count++;
					results.put(exp2, coff2);
				}
				
				
			}
		}
		Iterator iterator = results.keySet().iterator();
		
		System.out.print(count);
		while (iterator.hasNext()) {
			Object key = iterator.next();
			System.out.print(" "+ String.valueOf(key)+" "+String.format("%.1f", results.get(key)));	
		}
		
		scanner.close();
		
	}

}