PAT 1009 Product of 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 N1 aN1 N2 aN2… N​K aN​K where K is the number of nonzero terms in the polynomial, Ni and a​N​i(i=1,2,⋯,K) are the exponents and coefficients, respectively. It is given that 1≤K≤10, 0≤N
​K<⋯<N2<N1≤1000.

Output Specification:
For each test case you should output the product 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 up to 1 decimal place.

Sample Input:

2 1 2.4 0 3.2
2 2 1.5 1 0.5

Sample Output:

3 3 3.6 2 6.0 1 1.6

坑点：
1、多项式相乘结果，指数最大值为2000（测试点3，4）

2、系数为零的项不输出

我的代码：

#include<cstdio>
#include<map>
using namespace std;
const int maxn = 2010;
int main()
{
    int k,ep,cnt = 0;
    double co,result[maxn] = {0};
    map<int,double> p;
    scanf("%d",&k);
    for (int j = 0 ;j < k ;j++)
    {
        scanf("%d%lf",&ep,&co);
        p[ep] = co;
    }
    scanf("%d",&k);
    for (int j = 0 ;j < k ;j++)
    {
        scanf("%d%lf",&ep,&co);
        for (auto it = p.begin() ;it != p.end() ;it++)
            result[ep + it->first] += co * it->second;
    }
    for (int i = 0 ;i < maxn ;i++)
    {
        if (result[i] != 0)
            cnt++;
    }
    printf("%d",cnt);
    for (int i = maxn - 1 ;i >= 0 ;i--)
    {
        if (result[i] != 0)
            printf(" %d %.1f",i,result[i]);        
    }
    return 0;
}