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 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

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<iomanip>using namespace std;#define max 1001int main(){    int m, n, te;    double a[max+1] = {0};//这是c语言的表达，我一直在用c语言的思想写c++    double  tc;        cin >> m;    for (int i = 0; i < m; i++) {        cin >> te >> tc;        a[te] = tc;    }        cin >> n;    for (int i = 0; i < n; i++) {        cin >> te >> tc;        a[te] = a[te] + tc;    }        int cnt = 0;    for (int i = 0; i < max; i++) {        if (a[i]) {            cnt++;        }    }        cout << cnt;    for (int i = max-1; i >= 0; i--) {        if (a[i]) {//这里a[i]是浮点数理论上不能这样写            cout<< fixed << setprecision(1);//(只对浮点数有效？)            //加fixed表示固定点方式显示，这里的精度指的是小数位;不加fixed,则表示小数的总位数            cout << ' ' << i << ' ' << a[i];        }    }    cout << endl;}