1009 Product of 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 product 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 up to 1 decimal place.

Sample Input:
2 1 2.4 0 3.2
2 2 1.5 1 0.5
Sample Output:
3 3 3.6 2 6.0 1 1.6

---

#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;
int main(int argc, char const *argv[])
{
	int k;
	cin>>k;
	double a[1005] = {0.0}, ans[2005] = {0.0};
	for (int i = 0; i < k; ++i)
	{
		int pos;
		double val;
		cin>>pos>>val;
		a[pos] = val;
	}
	cin>>k;
	for (int i = 0; i < k; ++i)
	{
		int e;
		double c;
		cin>>e>>c;
		for (int j = 0; j < 1001; ++j)
		{
			if(a[j])
				ans[j+e] += a[j]*c; 
		}
	}
	int cnt = 0;
	for (int i = 0; i < 2001; ++i)
	{
		if(ans[i])
			cnt++;
	}
	cout<<cnt;
	for (int i = 2001; i >= 0; --i)
	{
		if(ans[i])
			printf(" %d %.1f",i,ans[i]);
	}
	return 0;
}