This time, you are supposed to find A+B where A and B are two polynomials.

Input

Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial: K N1 aN1 N2 aN2 … NK aNK, where K is the number of nonzero terms in the polynomial, Ni and aNi (i=1, 2, …, K) are the exponents and coefficients, respectively. It is given that 1 <= K <= 10,0 <= NK < … < N2 < N1 <=1000.

Output

For each test case you should output the sum of A and B in one line, with the same format as the input. Notice that there must be NO extra space at the end of each line. Please be accurate to 1 decimal place.

Sample Input

2 1 2.4 0 3.2 2 2 1.5 1 0.5

Sample Output

3 2 1.5 1 2.9 0 3.2

…多项式加法,输出保留一位小数。又是一道数组统计题。(这是一种非常常见的解题方法,效率很高。)

#include<iostream>
#include<iomanip>
using namespace std;
double pool[1005] = { 0 };
int main() {
	//input A
	int ka;
	cin >> ka;
	while (ka--) {
		double dt;
		int it;
		cin >> it >> dt;
		pool[it] = dt;
	}
	//input B
	int kb;
	cin >> kb;
	while (kb--) {
		double dt;
		int it;
		cin >> it >> dt;
		pool[it] += dt;
	}
	//out
	int count = 0;
	for (int i = 0; i < 1005; i++) {
		if (pool[i] != 0)
			count++;
	}
	cout << count;
	for (int i = 1004; i >= 0; i--) {
		if (pool[i] != 0) {
			cout <<fixed<<setprecision(1)<< " " << i << " " << pool[i];
		}
	}
	cout << endl;
	system("pause");
	return 0;
}