PAT A1002

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 <stdio.h>
using namespace std;
double sum[1005] = {0};
int main(){
    int m, n, index, i = 0;
    double ss;
    cin>>m;
    while(m--){
        cin>>index>>ss;
        sum[index] += ss;
        if(i < index)
            i = index;
    }
    cin>>n;
    while(n--){
        cin>>index>>ss;
        sum[index] += ss;
        if(i < index)
            i = index;
    }
    int jl = 0;
    for(int j = i; j >= 0; j--){
        if(sum[j] != 0.0)
            jl++;
    }
    cout<<jl;
    for(int j = i; j >= 0; j--){
        if(sum[j] != 0.0){
            printf(" %d %.1f", j, sum[j]);
        }
    }
    return 0;
}