1009_Product of Polynomials (25分)[模拟]

#include<iostream>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
const int  maxLen = 1000 + 10;

int K, maxRes, maxN, p;//maxNum记录结果的最大次数
double N[maxLen], res[maxLen * maxLen], pVal;

int main()
{
    memset(N, 0, sizeof(N));
    memset(res, 0, sizeof(res));
    maxN = maxRes = 0; 
    map<int, double> map;

    cin >> K;
    for (int i = 0; i < K; i++) {
        cin >> p;
        cin >> N[p];
        maxN = max(maxN, p);
    }

    cin >> K;
    for (int i = 0; i < K; i++) {
        cin >> p >> pVal;
        for (int i = 0; i <= maxN; i++) {
            if (N[i] != 0) {
                res[i + p] += N[i] * pVal;
                maxRes = max(maxRes, i + p);
            }
        }
    }
    for (int i = maxRes; i >= 0; i--) {
        if (res[i] != 0) {
            map[i] = res[i];
        }
    }
    cout << map.size();
    for (auto iter = map.rbegin(); iter != map.rend(); iter++) {
        printf(" %d %.1lf", iter->first, iter->second);
    }
    return 0;
}