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
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 coeficients, 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
题⽬⼤意：计算多项式A+B的和

解：这题能想到用一个数组c[i]=j, 其中i是指数，j是系数，表示指数i的系数为j，这样就很简单了，累计c中的非零系数的个数，就是输出结果的长度

#include <iostream>
#include <string>
using namespace std;

int main() {
	float c[1001] = { 0 };
	int k1, k2; //A,B的非零项个数
	int z; //指数
	float num; //系数
	scanf("%d", &k1);
	for (int i = 0; i < k1; i++) {
		scanf("%d%f", &z, &num);
		c[z] += num;
	}
	scanf("%d", &k2);
	for (int i = 0; i < k2; i++) {
		scanf("%d%f", &z, &num);
		c[z] += num;
	}

	int cnt = 0;
	for (int i = 0; i <1001; i++) {
		if (c[i] != 0) cnt++;
	}
	printf("%d",cnt);
	for (int i = 1000; i >= 0; i--) {
		if (c[i] != 0.0)
			printf(" %d %.1f", i, c[i]);
	}
	return 0;
}