PAT(甲) - 1009 Product of Polynomials

Product：多项式相乘

#include <bits/stdc++.h>
using namespace std;

typedef struct
{
    int e;
    double c;
} node;

vector<node> ve;
double cof[1000001];
int main()
{
    // ios::sync_with_stdio(false);
    int n;
    cin >> n;
    int e;
    double c;
    for (int j = 0; j < n; j++)
    {
        cin >> e >> c;
        node temp = {e, c};
        ve.push_back(temp);
    }
    int count = 0;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        cin >> e >> c;
        for (auto v : ve)
        {
            if (cof[v.e + e] == 0)
                count++;
            cof[v.e + e] += c * v.c;
            if (cof[v.e + e] == 0)
                count--;
        }
    }

    cout << count;
    for (int i = 1000001; i >= 0; i--)
    {
        if (cof[i] != 0)
            printf(" %d %.1f", i, cof[i]);
    }
}