PAT 甲级 1002. A+B for Polynomials

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>
using namespace std;

int main() {
    int k, exponent;
    double coefficient;
    double output[1001] = {0};
    cin >> k;
    for(int i = 0; i < k; ++i) {
        cin >> exponent >> coefficient;
        output[exponent] += coefficient;
    }
    cin >> k;
    for(int i = 0; i < k; ++i) {
        cin >> exponent >> coefficient;
        output[exponent] += coefficient;
    }
    int new_k = 0;
    for(int i = 1000; i >= 0; --i) {
        if(output[i] != 0)
            ++new_k;
    }
    cout << new_k;
    for(int i = 1000; i >= 0; --i) {
        if(output[i] != 0) {
            if(i == 0)
                printf(" %d %.1lf\n", i, output[i]);
            else
                printf(" %d %.1lf", i, output[i]);
        }
    }
}