1002. A+B for Polynomials (25)

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 a_N1 N2 a_N2 ... NK a_NK, where K is the number of nonzero terms in the polynomial, Ni and a_Ni (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.

2 1 2.4 0 3.22 2 1.5 1 0.5

3 2 1.5 1 2.9 0 3.2写对这道题目真不容易，花了好几天换了好几个思路，附上代码和注意事项 #include
    
     #include
     
      using namespace std;#define MAX 1001int main(){	double a[MAX];	for(int i=0;i
      
       >k1;	for(int i=0;i
       
        >m>>n;		a[m]+=n;//把每一项的值放入对应的第几项中去 	}	cin>>k2;	for(int i=0;i
        
         >m>>n;		a[m]+=n;	}	int num=0;	for(int i=0;i
         
          0;i--)//从大到小输出 { if(a[i]!=0) { cout<<" "<
          <<" "<
           
            <
            
             <