PAT A1002. 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.

2 1 2.4 0 3.22 2 1.5 1 0.5Sample Output
3 2 1.5 1 2.9 0 3.2
#include <cstdio>#include <algorithm>#define Max 1234using namespace std;int main(){	double f,c[Max]={};		int n,m,k=0;	scanf("%d",&n);	for(int i=0;i<n;i++)	{		scanf("%d %lf",&m,&f);		c[m]+=f;		}	scanf("%d",&n);	for(int i=0;i<n;i++)	{		scanf("%d %lf",&m,&f);		c[m]+=f;		}	    for(int i=0;i<Max;i++)	{		if(c[i]!=0.0)			k++;	}            PRintf("%d",k);		for(int i=Max-1 ;i>=0;i--)		{			if(c[i]!=0.0)			{				printf(" %d %.1f",i,c[i]);			}		}	system("pause");	return 0;}