1002. A+B for Polynomials (25)

#include<stdio.h>
#include<iostream>
using namespace std;


struct node
{
double x;
double sum;
};


node node[1002];


int main()
{
int k;
cin>>k;
for(int i=0;i<k;i++)
{
int x;
cin>>x;
cin>>node[x].x;
node[x].sum+=node[x].x;
//cout<<node[x].sum<<endl;
}
int n=k;
cin>>k;
if(k>n) n=k;
for(int i=0;i<k;i++)
{
int x;
cin>>x;
cin>>node[x].x;
node[x].sum+=node[x].x;
}
int num=0;
for(int i=1002;i>=0;i--)
{
if(node[i].sum!=0.)
{
num++;
}

}
if(num==0) cout<<"0";
    else{
cout<<num;
bool have=false;
for(int i=1002;i>=0;i--)
{


if(node[i].sum!=0)
{

cout<<" "<<i;
cout<<" ";
printf("%.1f",node[i].sum);
have=true;
}

}
}
return 0;
}