1002 A+B for Polynomials (25分)

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

#include <iostream>
#include <algorithm>
#include<vector>
#include<map>
#include<string>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<unordered_map>
#include<queue>
#include<climits>
using namespace std;
const int maxn= 1000+5;

double a[maxn],b[maxn],sum[maxn];
int main(){
	int k;
	cin>>k;
	while(k--){
		int e;
		double c;
		cin>>e>>c;
		a[e]=c;
		
	}
	cin>>k;
	while(k--){
		int e;
		double c;
		cin>>e>>c;
		b[e]=c;
		
	}
	for(int i=0;i<maxn;i++) sum[i]=a[i]+b[i];
	int j=0;
	for(int i=0;i<maxn;i++) {
		if(sum[i]!=0){
				
			j++;
		}
		
	
	}
	cout<<j;
	for(int i=maxn;i>=0;i--){
		if(sum[i]) printf(" %d %.1f",i,sum[i]);
	}
	
	return 0;	
}