PAT (Advanced Level) T1002 A+B for Polynomials

link

题目描述

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

输入描述

Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial:
K N₁ a_N1 N₂ a_N2 … N_​K a_NK
​​ where K is the number of nonzero terms in the polynomial, N_I and a_NI (i=1,2,⋯,K) are the exponents and coefficients, respectively. It is given that 1≤ K ≤10，0≤ N_K <⋯<N_​2 < N₁ ≤1000.

输出描述

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.

样例

2 1 2.4 0 3.2
2 2 1.5 1 0.5

3 2 1.5 1 2.9 0 3.2

思路

给两组数把相同编号的相加,利用桶的思想开数组存一下就好.
注意:相加最后为0的不计入!
所以这也让我们可以轻易通过if(a[i])找出有意义的编号.

实现

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;

int k,n,cnt;
double a[1005],m;

int main(){
	for(int i=0;i<2;i++){
		scanf("%d",&k);
		for(int j=0;j<k;j++){
			scanf("%d%lf",&n,&m);
			a[n]+=m;
		}
	}
	for(int i=0;i<1005;i++){
		if(a[i]) cnt++;
	}
	cout<<cnt;
	for(int i=1004;i>=0;i--){
		if(a[i]) printf(" %d %.1lf",i,a[i]);
	}

	return 0;
}

丢人

本来想用map+vector,但反正不会超空间,我太懒了!