1002. A+B for Polynomials

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 a_N1 N2 a_N2 ... NK a_NK, where K is the number of nonzero terms in the polynomial, Ni and a_Ni (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 <cstdio>

typedef struct NodeName{
	int exponent;
	float coefficient;
} Node;

Node A[1010], B[1010], Sum[1010];

int main(){
	int K1, K2;
	int exp;
	float coeff;
	scanf("%d", &K1);
	for(int i = 0; i < K1; ++i){
		scanf("%d %f", &exp, &coeff);
		A[exp].coefficient = coeff;
	}
	scanf("%d", &K2);
	for(int i = 0; i < K2; ++i){
		scanf("%d %f", &exp, &coeff);
		B[exp].coefficient = coeff;
	}

	for(int i = 0; i < 1010; ++i){
		Sum[i].coefficient = A[i].coefficient + B[i].coefficient;
	}

	int count = 0;
	for(int i = 0; i < 1010; ++ i){
		if(Sum[i].coefficient != 0)
			++ count;
	}
	printf("%d", count);

	for(int i = 1009; i >=0; --i){
		if(Sum[i].coefficient != 0){
			printf(" %d %.1f", i, Sum[i].coefficient);
		}
	}

	
	return 0;	
}