1002. A+B for Polynomials (25)

#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;
const int maxn = 10005;
double a[maxn];
int b[maxn];
double c[maxn];

int main(){
    ios::sync_with_stdio(false);
    int k;
    cin >> k;
    int x;
    double y;
    int Max = 0;
    for (int i = 1; i <= k; i++){
        cin >> x >> y;
        a[x] += y;
        if (Max < x)
            Max = x;
    }
    int k1;
    cin >> k1;
    for (int i = 1; i <= k1; i++){
        cin >> x >> y;
        a[x] += y;
        if (Max < x)
            Max = x;
    }
    int ans = 0;
    for (int i = Max; i >= 0; i--){
        if (a[i] == 0) continue;
        b[ans] = i;
        c[ans++] = a[i];
    }
    cout << ans;
    for (int i = 0; i < ans; i++){
        printf(" %d %.1lf", b[i], c[i]);
        //cout << " " << b[i] << " " << c[i];
    }
    //最后一行没有空格（包括换行）
    //cout << endl;
    system("pause");
    return 0;
}