1002. A+B for Polynomials (25)

1002.A+B for Polynomials (25)
时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B
判题程序 Standard 作者 CHEN, Yue
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 aN1 N2 aN2 … NK aNK, where K is the number of nonzero terms in the polynomial, Ni and aNi (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

#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
using namespace std;

#define PolySize 1001
#define eps 1e-2
int main()
{
    double Coffi[PolySize] = { 0 };
    int polyN ,SumPolyK = 0;
    cin >> polyN;
    for (int i = 0; i < polyN; ++i)
    {
        int exp;
        cin >> exp;
        cin >> Coffi[exp];
    }
    cin >> polyN;
    for (int i = 0; i < polyN; ++i)
    {
        int exp;
        double coffi;
        cin >> exp;
        cin >> coffi;
        Coffi[exp] += coffi;
    }
    for (int i = 0; i < PolySize; ++i)
    {
        if (abs(Coffi[i]) > eps)
            ++SumPolyK;
    }
    cout << SumPolyK;
    for (int i = PolySize - 1; i >= 0; --i)
    {
        if (abs(Coffi[i]) > eps)
        {
            cout << " " << i << " "<<fixed << setprecision(1)<< Coffi[i];
        }
    }
    //system("pause");
    return 0;
}