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:

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<map>
using namespace std;
int main()
{
    map<int,double> xishu;
    int k;
    cin>>k;
    while(k--)
    {
        int n;
        double d;
        cin>>n>>d;
        xishu[n]+=d;
    }
    cin>>k;
    while(k--)
    {
        int n;
        double d;
        cin>>n>>d;
        xishu[n]+=d;
        if(xishu[n]==0)xishu.erase(n);
    }
    cout<<xishu.size();
    for(auto it=xishu.end();it!=xishu.begin();){
        --it;
        printf(" %d %.1lf",it->first,it->second);
    }
    return 0;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31