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<vector>
#include<iomanip>
using namespace std;

#define max 10001
int main()
{
	float a[max],b[max];
	int n1,n2,i,j;
	float k;
	for(i=0;i<max;i++)
	{
		a[i]=b[i]=0;
	}
	cin>>n1;
	for(i=0;i<n1;i++)
	{
		cin>>j>>k;
		a[j]=k;
	}
	cin>>n2;
	for(i=0;i<n2;i++)
	{
		cin>>j>>k;
		b[j]=k;
	}
	int cnt=0;
	for(i=max-1;i>=0;i--)
	{
		a[i]=a[i]+b[i];
		if(a[i]!=0)
			cnt++;
	}
	cout<<cnt;
	for(i=max-1;i>=0;i--)
	{
		if(a[i]!=0)
		{
			cout<<setiosflags(ios::fixed);
			cout.precision(1);
			cout<<" "<<i<<" "<<a[i];
		}
	}

	return 0;
}