1002 A+B for Polynomials (25)（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.

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<iomanip>
using namespace std;
int main()
{
	double a[10000] = { 0 }, c;
	int b, k, max = 0, i = 0, num;
	cin >> num;
	for (i = 0; i < num; i++)
	{
		cin >> b;
		cin >> a[b];
		if (max < b&&a[b] != 0) max = b;
		if (a[b] == 0){num--;i--;}
	}
	cin >> k;
	for (i = 0; i < k; i++)
	{
		cin >> b;
		cin >> c;
		if (a[b] == 0)num++;
		a[b] += c;
		if (max < b&&a[b] != 0) max = b;
		if (a[b] == 0)num--;
	}
	cout << num;
	for (i = max; i >= 0; i--)
	{
		if (a[i] != 0)
			cout << ' ' << i << ' ' <<fixed<<setprecision(1)<< a[i];
	}
	return 0;
}