1009 Product of Polynomials

#include<iostream>
#include<stdio.h>
#include<vector>
using namespace std;
struct polynomial {
    int e;//指数
    double c;//系数
}t;
int main() {
    int A, B, i, j, k = 0;
    double r[2010] = { 0.0 };
    vector<polynomial>a, b;
    cin >> A;
    for (i = 1; i <= A; i++) {
        cin >> t.e;
        cin >> t.c;
        if (t.c != 0)
            a.push_back(t);
    }
    cin >> B;
    for (i = 1; i <= B; i++) {
        cin >> t.e;
        cin >> t.c;
        if (t.c != 0)
            b.push_back(t);
    }
    for (i = 0; i < a.size(); i++)
        for (j = 0; j < b.size(); j++) 
            r[a[i].e + b[j].e] += a[i].c * b[j].c;
    for (i = 2000; i >= 0; i--)
        if (r[i] != 0)
            k++;
    printf("%d", k);
    if (k != 0)
        printf(" ");
    for (i = 2000; i >= 0; i--) {
        if (r[i] != 0) {
            printf("%d %.1lf", i, r[i]);
            k--;
            if (k != 0)
                printf(" ");
        }
    }
    return 0;
}