PAT-甲级-1002 A+B for Polynomials (25 分)

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 N​1​​ a​N​1​​​​ N​2​​ a​N​2​​​​ ... N​K​​ a​N​

where K is the number of nonzero terms in the polynomial,  and a​N​i​​​​ (i=1,2,⋯,K) are the exponents and coefficients, respectively. It is given that 1≤K≤10，0≤​​<⋯<​<​​≤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

#include <iostream>
#include <algorithm>
#include <map>
using namespace std;
#define rep(i,j,k)    for(int i=j;i<k;i++)
int main(){
    int m,n,exp;
    map<int,float> a;
    float coeff;
    cin>>m;
    rep(i,0,m){
        cin>>exp>>coeff;
        a[exp] = coeff;
    }
    cin>>n;
    rep(i,0,n){
        cin>>exp>>coeff;
        a[exp] += coeff;
        if(a[exp]==0)
            a.erase(exp);
    }
    cout<<a.size();
    for(map<int,float>::reverse_iterator rit=a.rbegin();rit!=a.rend();rit++){
        printf(" %d %.1f",rit->first,rit->second);
    }
    return 0;
}