PAT

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.22 2 1.5 1 0.5

Sample Output

3 2 1.5 1 2.9 0 3.2

---

给定条件：
1.两个多项式A和B的系数和次数

要求：
1.A+B的结果

求解：
1.次数相同项，系数相加即可

---

#include <cstdio>#include <algorithm>using namespace std;int k1, k2;int a;double b, poly[1001], ans[1001];int main() {fill(ans, ans+1001, 0);fill(poly, poly+1001, 0);scanf("%d", &k1);for(int i = 0; i < k1; i++) {scanf("%d%lf", &a, &b);ans[a] += b;}scanf("%d", &k2);for(int i = 0; i < k2; i++) {scanf("%d%lf", &a, &b);ans[a] += b;}int cnt = 0;for(int i = 0; i < 1001; i++) {if(ans[i] != 0.0)cnt++;}printf("%d", cnt);for(int i = 1000; i >= 0; i--) {if(ans[i] != 0){printf(" %d %.1lf", i, ans[i]);}}printf("\n");return 0;}

---