1002. A+B for Polynomials (25)

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>

using namespace std;

const int MAXN = 1005;
double p[MAXN];

int main()
{
//  freopen("in.txt","r",stdin);

int k,cou=0;
scanf("%d",&k);
for(int i=0;i<k;i++)
{
int t1;
double t2;
scanf("%d %lf",&t1,&t2);
p[t1]+=t2;
}

scanf("%d",&k);
for(int i=0;i<k;i++)
{
int t1;
double t2;
scanf("%d %lf",&t1,&t2);
p[t1]+=t2;
}

for(int i=0;i<MAXN;i++)
{
if(p[i])
cou++;
}

printf("%d",cou);

for(int i=MAXN;i>=0;i--)
{
if(p[i])
printf(" %d %.1f",i,p[i]);
}

return 0;
}