题目连接
//1002. A + B for Polynomials(25)
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
using namespace std;
int main() {
int k, j, count = 0;
float temp;
float a[1001];
for (int i = 0; i <= 1000; i++)
a[i] = 0.0f;//不加f默认是double类型
cin >> k;
while (k--) {
cin >> j;
cin >> temp;
a[j] += temp;
}
cin >> k;
while (k--) {
cin >> j;
cin >> temp;
a[j] += temp;
}
for (int i = 0; i <= 1000; i++)
if (a[i] != 0)
count++;
cout << count;
if (count != 0)
cout << ' ';
for (int i = 1000; i >= 0; i--) {
if (a[i] != 0){
cout << i << ' ';
cout << fixed << setprecision(1) << a[i];
count--;
if (count != 0)
cout << ' ';
}
return 0;
}
return 0;
}