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 aN1 N2 aN2 ... NK aNK, where K is the number of nonzero terms in the polynomial, Ni and aNi (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

#include <iostream>#include <cstdio>#include <cstdlib>using namespace std;int main() {    float A[1001] = {0};    float B[1001] = {0};    int k;    cin >> k;    float c;    int e;    for (int i = 0; i < k; i++) {        cin >> e >> c;        A[e] = c;    }    cin >> k;    for (int i = 0; i < k; i++) {        cin >> e >> c;        B[e] = c;    }        int nonzeor__cnt = 0;    for (int i = 0; i < 1001; i++) {        A[i] = A[i] + B[i];        if (A[i]) nonzeor__cnt++;    }   printf("%d%s",nonzeor__cnt,((nonzeor__cnt == 0)? "" : " "));    int cnt = 0;    for (int i = 1000; i >= 0; i--) {        if (A[i]) {            cnt++;            printf("%d %.1f%s",i,A[i],(cnt < nonzeor__cnt ? " " : ""));        }    }    system("pause");    return 0;}