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

Sample Output

3 2 1.5 1 2.9 0 3.2

多项式的加法,次数一定是0-1000的正整数;

#include <bits/stdc++.h>
#define LL long long
#define MAXN 1000+50
#define MOD 1000000007
using namespace std;

vector<pair<int,double> > arr;
double s[MAXN];
int  main(){
    memset(s, 0, sizeof(s));
    int k, n;
    double p;
    scanf("%d", &k);
    for(int i = 0; i < k; ++i){
        scanf("%d%lf", &n, &p);
        s[n] += p;
    }
    scanf("%d", &k);
    for(int i = 0; i < k; ++i){
        scanf("%d%lf", &n, &p);
        s[n] += p;
    }
    for(int i = MAXN-1; i >= 0; --i){
        if(s[i]){
            arr.push_back(make_pair(i, s[i]));
        }
    }
    int sz = arr.size();
    printf("%d", sz);
    for(int i = 0; i < sz; ++i){
        printf(" %d %.1lf", arr[i].first, arr[i].second);
    }
    return 0;
}