1002. A+B for Polynomials (25)

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<iostream>
#include<iomanip>
#include<limits>
using namespace std;
#define  MAXF 0
void initarray(double *a,int n)
{
	for(int i=0;i<n;i++){
		a[i]=MAXF;
	}
}
int main()
{
#define N 1001
	double a[N];
	initarray(a,N);
	int k1,k2;
	int count=0;
	int i;
	cin>>k1;
	for(i=0;i<k1;i++){
		int exponent;
		double coefficient;
		cin>>exponent;
		cin>>coefficient;
		a[exponent]+=coefficient;
	}
	cin>>k2;
	for(i=0;i<k2;i++){
		int exponent; 
		double coefficient;
		cin>>exponent;
		cin>>coefficient;
		a[exponent]+=coefficient;
	}
	for(i=0;i<N;i++)
		if(a[i]!=MAXF) count++;
	cout<<count;
	for(i=N-1;i>=0;i--){
		if(a[i]!=MAXF){
			cout<<fixed<<setprecision(1);
			cout<<" "<<i<<" "<<a[i];
		}
	}
	return 0;	
}