PAT 1009. Product of Polynomials (25)

//1009. Product of Polynomials (25)
//acc
#include<iostream>
#include <vector>
#include <algorithm>
using namespace std;


typedef struct
{
int e;
float c;
}poly;
int main()
{
int k1,k2;
cin >> k1;
poly a[10], b[10];
poly c;


vector<double> t;
int i = 0;
int j;


t.assign(3000, 0.0);

for (i=0;i<k1;i++)
{
cin >> a[i].e >> a[i].c;
}
cin >> k2;
for (i=0;i<k2;i++)
{
cin >> b[i].e >>  b[i].c;
}


for (i = 0;i<k1;i++)
{
for(j=0;j<k2;j++)
{
c.e = a[i].e + b[j].e;
c.c = a[i].c * b[j].c;
t[c.e] += c.c;
}
}


int start = a[0].e + b[0].e;
int end = a[k1-1].e + b[k2-1].e;
int count = 0;
for (i = start; i>= end;i--)
{
if (t[i] != 0)
{
count ++;
}
}
cout<<count << " ";


for (i = start ;i> end; i--)
{
if (t[i] !=0)
{
cout << i <<" ";
printf("%.1f ", t[i]);
}
}


cout << i << " ";
printf("%.1f", t[i]);


return 0;
}