1009. Product of Polynomials (25)

#include <iostream>
#include <cmath>
#include <cstdio>
using namespace std;

#define N 1001

int main(int argc, char **argv) {
	int K, n;
	double c[2][N] = {{0}}, p[N*2] = {0};
	double co;
	
	for(int i = 0; i < 2; i ++ ) {
        cin >> K;
		for(int j = 0; j < K; j ++) {
			cin >> n >> co;
			c[i][n] = co;
		}
	}
	for(int i = 0; i < N; i ++) {
		for(int j = 0; j < N; j ++) {
			if(c[0][i] && c[1][j]) {
				p[i+j] += c[0][i]*c[1][j];
			}
		}
	}
	K = 0;
	for(int i = 0; i < N*2; i ++) {
		if(abs(p[i]) >= 0.1)
			K++;
	}
	cout << K;
	for(int i = N*2-1; i >= 0; i --) {
		if(abs(p[i])) {
			printf(" %d %.1lf", i, p[i]);
		}
	}
	cout << endl;
	return 0;
}