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

Sample Output

3 2 1.5 1 2.9 0 3.2

#include <iostream>#include <string>using namespace std;bool v[1001];double arr[1001];void init(){for(int i = 0; i < 1001; ++i){v[i] = false;arr[i] = 0.0;}}int main(int argc, char* argv[]){init();int i,ni,k;double ani;int count = 0;scanf("%d",&k);for(i = 0; i < k; ++i){scanf("%d %lf",&ni,&ani);arr[ni] = ani;v[ni] = true;}scanf("%d",&k);for(i = 0; i < k; ++i){scanf("%d %lf",&ni,&ani);if(v[ni]){arr[ni] += ani;} else{arr[ni] = ani;}v[ni] = true;}for(i = 0;i < 1001; ++i){if(v[i] && arr[i] != 0)count++;}printf("%d",count);for(i = 1000; i >= 0; --i){if(v[i] && arr[i] != 0){printf(" %d %.1lf",i,arr[i]);}}printf("\n");return 0;}