题目描述：

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

参考代码：

分析：给出俩个多项式的指数和系数，没有给出基数，只要将指数相同的多项式进行系数相加即可。输出时按照指数从高到低的顺序输出。

            最后输出的结果原先是这样输出：            

[cpp] view plaincopyprint printf(" %d% .1lf",i,input[i]);  

      printf(" %d% .1lf",i,input[i]);           但是会有一组数据不通过。后来改为如下：           [cpp] view plaincopyprint cout<   
#include   
#include   
#include   
using namespace std;  
#define max 1000   
double input[max + 1];  
  
int main()  
{  
    int k,count;  
    int i,expo;  
    double coef;  
    cin>>k;  
    memset(input,0,sizeof(input));  
    for(i=0; i>expo>>coef;  
        input[expo] += coef;  
    }  
    cin>>k;  
    for(i=0; i>expo>>coef;  
        input[expo] += coef;  
    }  
  
    count = 0;  
    for(i=1000; i>=0; i--)  
        if(input[i] != 0) count++;  
  
    cout<=0; i--)  
        if(input[i] != 0.0)  
        {  
            cout<
#include
#include
#include
using namespace std;
#define max 1000
double input[max + 1];

int main()
{
	int k,count;
	int i,expo;
	double coef;
	cin>>k;
	memset(input,0,sizeof(input));
	for(i=0; i>expo>>coef;
		input[expo] += coef;
	}
	cin>>k;
	for(i=0; i>expo>>coef;
		input[expo] += coef;
	}

	count = 0;
	for(i=1000; i>=0; i--)
		if(input[i] != 0) count++;

	cout<=0; i--)
		if(input[i] != 0.0)
		{
			cout<