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

题意：计算多项式 A+B 的和。
思路：

建立数组 a[ ]，长度比指数的最大值 1000 稍大即可；将第一个多项式用标记数组的方法存入到数组中，再将第二个多项式在第一个的基础上进行累加，最后，统计两多项式的和共有几项，输出，之后，再按指数的从大到小输出指数和相应的系数。

c++代码： 

#include<iostream>
#include<cstring> 
using namespace std;
double a[1010];
int main(){
	int k1, k2, n, t=0;
	double x;
	cin >> k1;
	memset(a, 0, sizeof(a));
	for(int i = 0; i < k1; i++){
		cin >> n >> x;
		a[n] = x;
	}
	cin >> k2;
	for(int i = 0; i < k2; i++){
		cin >> n >> x;
		a[n] += x;
	}
	for(int i = 0; i < 1010; i++){
		if(a[i])	t++;
	}
	cout << t;
	for(int i = 1010; i >= 0; i--){
		if(a[i]){
			printf(" %d %.1lf", i, a[i]);
		}
	}
	return 0;
}