This time, you are supposed to find A+B where A and B are two polynomials.

Input Specification:

Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial:

K N1​ aN1​​ N2​ aN2​​ ... NK​ aNK​​

where K is the number of nonzero terms in the polynomial, Ni​ and aNi​​ (i=1,2,⋯,K) are the exponents and coefficients, respectively. It is given that 1≤K≤10，0≤NK​<⋯<N2​<N1​≤1000.

Output Specification:

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

结尾无空行

作者

CHEN, Yue

单位

浙江大学

代码长度限制

16 KB

时间限制

400 ms

内存限制

64 MB

#include<iostream>
using namespace std;
int main()
{
    int b = 2, max = 0, cnt = 0; 
    double c[1010] = { 0 };
    while (b--) {
        int k, n;
        double a;
        cin >> k;
        while (k--) {
            cin >> n >> a;
            c[n] += a;
            if (n > max)max = n;
        }
    }
    for (int i = max; i >= 0; i--) {
        if (c[i] != 0)cnt++;
    }
    cout << cnt;
    for (int i = max; i >= 0; i--) {
        if (c[i] != 0)printf(" %d %.1f",i,c[i]);
    }
    return 0;
}