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

where K is the number of nonzero terms in the polynomial, N​i​​ and a​N​i​​​​ (i=1,2,⋯,K) are the exponents and coefficients, respectively. It is given that 1≤K≤10，0≤N​K​​<⋯<N​2​​<N​1​​≤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<vector>
#include<cstdio>
#include<iostream>
#include<map>
using namespace std;
map<int,double> p;
int main(){
    for(int i=0;i<2;++i){
        int n;
        scanf("%d", &n);
        for(int i=0;i<n;++i){
            int a;
            double b;
            scanf("%d%lf",&a,&b);
            p[a] += b;
        }
    }
    vector<pair<int, double> > res;
    for(map<int, double>::reverse_iterator it=p.rbegin(); it!=p.rend(); ++it){
        if(it->second != 0)
            res.push_back(make_pair(it->first, it->second));
    }
    printf("%lu",res.size());
    for(int i = 0; i < res.size(); ++i)
        printf(" %d %.1f", res[i].first, res[i].second);
    return 0;
}