PAT:1002 A+B for Polynomials (25分)(数组）

1002 A+B for Polynomials (25分)

This time, you are supposed to find A+B where A and B are two polynomials.

Input Specification:
Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial:

K N
​1
​​ a
​N
​1
​​
​​ N
​2
​​ a
​N
​2
​​
​​ … N
​K
​​ a
​N
​K
​​
​​

where K is the number of nonzero terms in the polynomial, N
​i
​​ and a
​N
​i
​​
​​ (i=1,2,⋯,K) are the exponents and coefficients, respectively. It is given that 1≤K≤10，0≤N
​K
​​ <⋯<N
​2
​​ <N
​1
​​ ≤1000.

Output Specification:
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

这道题比较容易想到，用double数组，下标存储指数，double存储系数，第二次输入时，让数组相加就完成了。之后再正反遍历两次，分别求出cnt，与输出

#include<bits/stdc++.h>
using namespace std;
double a[10001]={0};
int main(){
    int k,b,m;
    float c;
    cin>>k;
    for(int i=0;i<k;i++){
        scanf("%d %f",&b,&c);
        a[b]=c;
    }
    cin>>m;
    for(int i=0;i<m;i++){
        scanf("%d %f",&b,&c);
        a[b]+=c;
    }
    int cnt=0;
    for(int i=0;i<10001;i++){
        if(a[i]!=0) cnt++;
    }
    cout<<cnt;
    for(int i=10001;i>=0;i--){
        if(a[i]!=0) printf(" %d %.1f",i,a[i]);
    }
}