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

代码一直只有17分，不知道为什么，请各位大神指正，谢谢。

#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cctype>
#include <string.h>
using namespace std;
int main(){
    map<int,float> m;
    int k;
    cin>>k;
    for(int i=0;i<k;i++){
        int a;
        float b;
        cin>>a>>b;
        m[a]+=b;
    }
    cin>>k;
    for(int i=0;i<k;i++){
        int a;
        float b;
        cin>>a>>b;
        m[a]+=b;
    }
    cout<<m.size();
    map<int,float>::reverse_iterator it;
    for(it=m.rbegin();it!=m.rend();it++)
        printf(" %d %.1f",it->first,it->second);
    return 0;
}