PAT Advanced 1002

1002. A+B for Polynomials (25)

时间限制

400 ms

内存限制

32000 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<string>
#include<map>
using namespace std;
int main()
{
    float data[1200] = {0};
    int k;
    int max_jieci = 0;
    int num;
    float temp;
    cin>>k;
    while(k--)
    {
        cin>>num;
        cin>>temp;
        max_jieci = max(num, max_jieci);
        data[num]+=temp;
    }
    cin>>k;
    while(k--)
    {
        cin>>num;
        cin>>temp;
        max_jieci = max(num, max_jieci);
        data[num]+=temp;
    }
    int counter = 0;
    for(int i = 0; i <= max_jieci; i++)
    {
        if(0 != data[i])
        {
            counter++;
        }
    }
    cout<<counter;
    for(int i = max_jieci; i >= 0; i--)
    {
        if (0 != data[i])
            printf(" %d %.1f",i,data[i]);
    }
    return 0;
}