PAT甲级-1002-多项式加减

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

#include <stdio.h>
#include <algorithm>
#include <stdlib.h>
#include <malloc.h>
#include <string.h>
#include <iostream>
using namespace std;

int main() {
	int k;
	while (scanf("%d", &k) != EOF) {
		float num[1050] = { 0 };
		int dex[1050];
		int flag[1050];
		int t, cnt = 0;
		float flo;
		memset(flag, -1, sizeof flag);
		memset(dex, -1, sizeof(dex));
		for (int i = 0; i < k; i++) {
			scanf("%d%f", &t, &flo);
			if (num[t] == 0 && flag[t] == -1) {
				dex[cnt++] = t;
				flag[t] = 1;
			}
			num[t] += flo;
		}
		scanf("%d", &k);
		for (int i = 0; i < k; i++) {
			scanf("%d%f", &t, &flo);
			if (num[t] == 0 && flag[t] == -1) {
				dex[cnt++] = t;
				flag[t] = 1;
			}
			num[t] += flo;
		}
		sort(dex, dex + cnt);
		int cnn = cnt;
		for (int i = 0; i < cnt; i++) {
			if (num[dex[i]] == 0) cnn--;
		}
		printf(cnn==0?"%d\n":"%d", cnn);
		if (cnn == 0) continue;
		for (int i = cnt - 1; i >= 0; i--) {
			if (num[dex[i]]) printf(" %d %.1f", dex[i], num[dex[i]]);
		}
		printf("\n");
	}
}