PAT1002-A+B for Polynomials

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>
using namespace std;
int main()
{
 float array[1001];                              //建立长度为1001的数组
 int a, b;
 scanf("%d", &a);
 for (int i = 0; i < 1001; i++) 
 { array[i] = 0; }                               //置数组所有元素值为0
 while (a--) {                                   //将第一行的各个元素值放入相对应的数组元素中
  int p;
  float m;
  scanf(" %d %f",&p, &m);
  array[p] += m;
 }
 char x;
 scanf("%c", &x); 
 scanf("%d", &b);              
 while (b--) {                                   //将第二行的各个元素值与相对应的数组元素相加并保存
  int q; 
  float n;
  scanf(" %d %f", &q, &n);
  array[q] += n;
 }
 int count = 0;
 for (int i = 0; i < 1001; i++)                  //统计数组中非零元素的个数，即多项式的项数
 {
  if (array[i] != 0)
   count++;
 }
 printf("%d", count);
 for (int i = 1000; i >=0 ; i--)                 //按从高到低次幂的顺序输出多项式指数和系数
 {
  if (array[i] != 0) {
   printf(" %d %.1f", i, array[i]);
  }
 }
 system("pause");
 return 0;}