PAT 1002

1002 A+B for Polynomials (25)（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 <bits/stdc++.h>
using namespace std;

int main()
{
    double poly[1005];
    int k,a;
    double b;
    memset(poly,0,sizeof(poly));
    for(int i=0;i<2;i++)
    {
        scanf("%d",&k);
        for(int j=0;j<k;j++)
        {
            scanf("%d%lf",&a,&b);
            poly[a]+=b;
        }
    }
    int num=0;
    for(int i=0;i<1005;i++)
    {
        if(poly[i]!=0)
            num++;
    }
    printf("%d",num);
    for(int i=1004;i>=0;i--)
    {
        if(poly[i]!=0)
        {
            printf(" %d %.1lf",i,poly[i]);
        }
    }
            printf("\n");
    return 0;
}