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

我是用map来解决这道题的，有两个坑，一个是要注意两数（正负）之和为0的情况，还有就是输出格式和精度的问题。AC代码如下：

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <set>
#include <map>
using namespace std;
int main()
{
    int k,i,e,j;
    double c;
    map<int,double>sum_map;
    map<int,double>::iterator iter_map=sum_map.begin();
    cin>>k;
    for(i=0;i<k;++i)
    {
        cin>>e>>c;
        sum_map.insert(pair<int,double>(e,c));
    }
    cin>>k;
    for(i=0;i<k;++i)
    {
        cin>>e>>c;
        if(sum_map.find(e)!=sum_map.end())//exist
        {
            sum_map.find(e)->second+=c;
            if(sum_map.find(e)->second==0)
                j=sum_map.erase(e);
        }
        else//not exist
            sum_map.insert(pair<int,double>(e,c));
    }
    cout<<sum_map.size();
    map<int,double>::reverse_iterator re_iter;
    for(re_iter=sum_map.rbegin();re_iter!=sum_map.rend();++re_iter)
        printf(" %d %.1f",re_iter->first,re_iter->second);

    return 0;
}