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 题解：这题比较简单，算是入门甲级的基础题吧。可以用p[i]表示指数为i的系数，最后算出非零项。
代码：
#include <cstdio> const int maxn=1005; double p[maxn]; int main(){ int k,n,cnt=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<k;i++){ scanf("%d%lf",&n,&a); p[n]+=a; } for(int i=0;i<maxn;i++){ if(p[i]) cnt++; } printf("%d",cnt); for(int i=maxn-1;i>=0;i--){ if(p[i]) printf(" %d %.1f",i,p[i]); } return 0; }
