1002 A + B for Polynomials (25 minutes) (a simple simulation, to one decimal place)

Topic links: https://pintia.cn/problem-sets/994805342720868352/problems/994805526272000000

Note: to one decimal place

#include <algorithm>
#include <iostream>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
using namespace std;
const int maxn = 0x3f3f3f3f;
typedef long long ll;
int main() {
int k;
double a[1005];
memset(a,0,sizeof(a));
cin >> k;
int x;
double y;
for(int i = 0; i < k; i++) {
cin >> x >> y;
a[x] += y;
}
cin >> k;
for(int i = 0; i <k; i++) {
cin >> x >> y;
a[x] += y;
}
k = 0;
for(int i = 1000; i >= 0; i--) {
if(a[i] != 0) k++;
}
cout << k;
for(int i = 1000; i >= 0; i--) {
if(a[i] != 0) printf(" %d %.1lf",i,a[i]);
}
return 0;
}