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_aN1N2_aN2… NK_a​NK
​​
​where K is the number of nonzero terms in the polynomial, N​i​ and aNi​​ (i=1,2,⋯,K) are the exponents and coefficients, respectively. It is given that 1≤K≤10，0≤N_​K<⋯<N₂<N₁≤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>

using namespace std;
const int maxn = 1010;

double p[maxn] = {0};
int main(){
	int k, n, count = 0;
	double a;
	cin >> k;
	for(int i = 0; i < k; i++){
		cin >> n >> a;
		p[n] += a;
	}
	cin >> k;
	for(int i = 0; i < k; i++){
		cin >> n >> a;
		p[n] += a;
	}
	for(int i = 0; i < maxn; i++){
		if(p[i] != 0){
			count++;
		}
	}
	printf("%d", count);
	for(int i = maxn - 1; i >= 0; i--){
		if(p[i] != 0) 
			printf(" %d %.1f", i, p[i]);	//精确到1位小数
	}
	return 0;
}