PAT甲级无算法1009 Product of Polynomials

报段错误，很大可能是数组越界 

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 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

#include<bits/stdc++.h>
using namespace std;
int main(){
    int k1,k2;
    double s[1010]={},res[2010]={};//一开始数组开小了导致出错。
    int a,c=0;
    double b;
    scanf("%d",&k1);
    for(int i=0;i<k1;i++){
        scanf("%d %lf",&a,&b);
        s[a]=s[a]+b;
    }
    scanf("%d",&k2);
    for(int i=0;i<k2;i++){
        scanf("%d %lf",&a,&b);
        for(int j=0;j<1010;j++){
            if(s[j]!=0){
                res[j+a] += s[j]*b;//不同组合乘机的次数可能相等，要合并同类项
            }
        }
    }
    for(int i=0;i<2002;i++)
        if(res[i]!=0)c++;
    cout<<c;
    for(int i=2000;i>=0;i--){
        if(res[i]!=0){
            printf(" %d %.1lf",i,res[i]);
        }
    }
    return 0;
}