PAT甲级1002. A+B for Polynomials (25)

#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
float a[1001]={0};
float coe;
int k,i,exp,total=0;
cin>>k;
for(i=1;i<=k;i++)
{
cin>>exp>>coe;
a[exp]=coe;
total++;
}
cin>>k;
for(i=1;i<=k;i++)
{
cin>>exp>>coe;
if(a[exp]==0) total++;
a[exp]=a[exp]+coe;
if(a[exp]==0) total--;
}
cout<<total;
for(i=1000;i>=0;i--)
{
if(a[i]!=0) cout<<" "<<i<<" "<<fixed<<setprecision(1)<<a[i];
}
return 0;

} 

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