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 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
const int max_n = 10000;//反正10000这个数必须取到
double p[max_n] = {0};
int main()
{
    int k, n, count = 0;
    double a;
    scanf("%d", &k);//非零项的个数
    for(int i = 0; i < k;i++)
    {
        scanf("%d %lf", &n, &a);//符合题目输入
        p[n] += a;
    }
     scanf("%d", &k);
    for(int i = 0; i = 0; i--){
        if(p[i] != 0) printf(" %d %.1f", i ,p[i]);//输出非零项，还有格式
    }
    return 0;
}