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 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 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#include<stdio.h>
int main()
{
int n1,n2,i,maxx=0,maxy=0;
int x;float y;
scanf("%d",&n1);
float a[1001]={0};
for(i=0;i<n1;i++)
{
scanf("%d%f",&x,&y);
a[x]=y;
if(x>maxx)
maxx=x;
}
scanf("%d",&n2);
float b[1001]={0};
for(i=0;i<n2;i++)
{
scanf("%d%f",&x,&y);
b[x]=y;
if(x>maxy)
maxy=x;
}
int num=(maxx>maxy?maxx:maxy)+1;int k=0;
float c[num+1];
for(i=0;i<num;i++)
{
c[i]=a[i]+b[i];
if(c[i]!=0)
k++;
}
printf("%d",k);
for(i=num-1;i>=0;i--){
if(c[i]!=0)
printf(" %d %.1f",i,c[i]);
}
}