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.

code

#include <iostream>
#include <map>
#include <iomanip>
using namespace std;

int main(){
    int num;
    int exp;
    double coef;
    int i;
    cin >> num;
    map<int, double> res;
    for(i=0;i<num;i++){
        std::cin >> exp;
        std::cin >> coef;
        res[exp] = coef;
    }
    std::cin >> num;
    for(i=0;i<num;i++){
        std::cin >> exp;
        std::cin >> coef;
        res[exp] += coef;
        if(res[exp] == 0){
            res.erase(exp);
        }
    }
    cout << res.size();
    map<int, double>::reverse_iterator iter;
    for(iter = res.rbegin(); iter != res.rend(); iter++){
        cout << fixed << setprecision(1) << ' ' << iter->first << ' ' << iter->second;
    }
    return 0;
}