多项式问题, 参考了大佬的题解 非常简洁。
#include<bits/stdc++.h>
using namespace std;
const int N = 1004;
double a[N];
int k, k2, expp;
double coe;
int ww;
int main() {
cin >> k;
for (int i = 0; i < k; i++){
cin >> expp >> coe;
a[expp] += coe;
}
cin >> k2;
for (int i = 0; i < k2; i++){
cin >> expp >> coe;
a[expp] += coe;
}
for (int i = 0; i < N; i++){
if (a[i] != 0) ww++;
}
cout << ww ;
for (int i = N-1; i >= 0; i--){
if (a[i] != 0.0){
printf(" %d %.1f", i, a[i]);
}
}
return 0;
}