1002 A+B for 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 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 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

My Code:

#include<stdio.h>
int main(){
	int m,n,a,i,cnt=0;
	double b,c[1001],d[1001];
	for(i=0;i<1001;i++){
		c[i]=0;
		d[i]=0;
	}
	scanf("%d",&m);
	for(i=0;i<m;i++){
		scanf("%d%lf",&a,&b);  //c[2]=0,c[1]=2.4,c[0]=3.2
		c[a]=b;
	}
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d%lf",&a,&b);  //d[2]=1.5,d[1]=0.5,d[0]=0
		d[a]=b;
	}
	for(i=1000;i>=0;i--){
        c[i]+=d[i];  //把c设置成c+b的和
		if(c[i]){  //如果和不等于0（有可能两个都为0或者互为相反数相加为0）
			cnt++;
		}
		
	}
	printf("%d",cnt);
	for(i=1000;i>=0;i--){
		if(c[i]){
			printf(" %d %.1f",i,c[i]);
		}
	}
	return 0;
}