1002 A+B for Polynomials

#include<iostream>
using namespace std;
struct node{
	int exp;
	double coe;
}a[30], b[30], c[30];
int main(){
   	int n1, n2;
	scanf("%d", &n1);
	for(int i = 0; i < n1; i++){
		scanf("%d%lf", &a[i].exp, &a[i].coe);
	} 
	scanf("%d", &n2);
	for(int i = 0; i < n2; i++){
		scanf("%d%lf", &b[i].exp, &b[i].coe);
	}
	int cnt = 0;
	for(int i = 0, j = 0; i < n1 || j < n2; ){
		if(a[i].exp > b[j].exp && i < n1) {
			c[cnt].coe = a[i].coe;
			c[cnt].exp = a[i].exp;
			i++, cnt++;
		} else if(a[i].exp < b[j].exp && j < n2){
			c[cnt].coe = b[j].coe;
			c[cnt].exp = b[j].exp;
			j++, cnt++;
		}else if(i < n1 || j < n2 && a[i].exp == b[j].exp){
			if(a[i].coe + b[j].coe != 0.0){
				c[cnt].coe = a[i].coe + b[j].coe;
				c[cnt].exp = a[i].exp;
				cnt++;
			}
			i++, j++;	
		}
	}
	printf("%d", cnt);
	for(int i = 0; i < cnt; i++){
		printf(" ");
		if(c[i].coe != 0.0) printf("%d %.1lf", c[i].exp, c[i].coe);
	}
}

晴神笔记版本

#include<cstdio>
const int max_n = 1111;
double p[max_n] = {};

int main(){
	int k, n, count = 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 < max_n; i++)
		if(p[i] != 0) count++;
	printf("%d", count);
	for(int i = max_n - 1; i >= 0; i--){
		if(p[i] != 0) printf(" %d %.1f", i, p[i]);
	}
}