pintia_a1002

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 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 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

错误点：

1. 未保留一位小数

2. 系数相加为0时，该项不输出

#include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;

const int MAXN = 1000 + 5;
double coes[MAXN];

int cmp(int a, int b){
	return a > b;
}

int main(){
	int k1, k2;
	int exp; double coe;
	
	while(cin >> k1){
		vector<int> exps;
		fill(coes, coes + MAXN, 0);
		int cnt = 0;
		for(int i = 0; i < k1; ++ i){
			cin >> exp >> coe;
			coes[exp] = coe;
			++ cnt;
			exps.push_back(exp);
		}
		cin >> k2;
		for(int i = 0; i < k2; ++ i){
			cin >> exp >> coe;
			if(coes[exp] == 0){
				++ cnt;
				exps.push_back(exp);
			}
			coes[exp] += coe;
			if(coes[exp] == 0){
				-- cnt;
			}
		}
		cout << cnt;
		sort(exps.begin(), exps.end(), cmp);
		for(int i = 0; i < exps.size(); ++ i){
			if(coes[exps[i]] != 0){
				printf(" %d %.1f", exps[i], coes[exps[i]]);
			}
		}
		cout << endl;
	}
	
	return 0;
}