1002. A+B for Polynomials

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

求两个多项式的和，按给定的格式输出。注意某一项系数如果变为0则该项就没了。用map很简单的就能实现（注意要输出顺序）。

代码：

#include<iostream>
#include<vector>
#include<cstring>
#include<cstdlib>
#include<map>
using namespace std;

int main()
{
	int m,n;
	cin>>m;
	map<int,double>poly;
	for(int i=0;i<m;i++)
	{
		int ex;double co;
		cin>>ex>>co;
		poly[ex]=co;
	}
	cin>>n;
	int count=m;
	for(int i=0;i<n;i++)
	{
		int ex;double co;
		cin>>ex>>co;
		if(poly[ex]==0) count++;
		poly[ex]+=co;
		if(poly[ex]==0) count--;
	}
	cout<<count;
	map<int,double>::reverse_iterator it;
	for(it=poly.rbegin();it!=poly.rend();it++)
	{
		if(it->second!=0) printf(" %d %.1f",it->first,it->second);
	}
}