1002 PAT甲级（多项式合并）C++实现

题目

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

---------------------------------------------------------------------------------------------

看了几个别人的方法都挺长

贴下自己的

主要是把数组当成python的字典来用，多项式指数看成字典的key（数组下标），系数看成字典的value（数组值）

#include <stdio.h>
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
using namespace std;
int main(){
    float a[1001]={0};
    float b[1001]={0};
    int number_item=0;
    int zhishu=0;
    string result;
    
    int result_count=0;
    float xishu;
    cin>>number_item;
    for (int i=0; i<number_item; i++) {
        cin>>zhishu>>xishu;
        a[zhishu]+=xishu;
    }
    cin>>number_item;
    for (int i=0; i<number_item; i++) {
        cin>>zhishu>>xishu;
        b[zhishu]+=xishu;
    }
    for (int i=1000; i>=0; i--) {
        if ((a[i]+b[i])!=0) {
            result_count++;
            xishu=a[i]+b[i];
//            cout<<i<<' '<<a[i]<<' '<<b[i]<<endl;
            stringstream str_xishu;
            stringstream str_zhishu;
            str_xishu<<fixed<<setprecision(1)<<xishu;
            str_zhishu<<i;
            result=result+' '+str_zhishu.str()+' '+str_xishu.str();
        }
    }
    cout<<result_count<<result<<endl;
    
}