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.

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

多项式相加问题，有两种解决的方案，一种是用链表，第二种使用int[1001]的数组。链表法能节约时间，但是操作链表容易出错，还要检查边界，数组法比较简单，容易实现，不易出错。还要注意处理表中的个数。

#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
	int n;
	int count=0;
	double a[1001]={0};
	for(int j=0;j<2;j++)
	{
		cin>>n;
		while(n--)
		{
			int m;
			cin>>m;
			double k;
			cin>>k;
			if(a[m]==0)
				count++;
			a[m]+=k;
			if(a[m]==0)//小陷阱
				count--;
		}
	}
	cout<<count;
	for(int i=1000;i>=0;i--)
	{
		if(a[i]!=0)
			 printf(" %d %.1lf", i, a[i]);
	}
	return 0;
}