#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <cstdlib>
#include <stack>
#include <vector>
#include <set>
#include <map>
using namespace std;
struct p{
int ni;
double ani;
} num[1010];
int main()
{
//freopen("G://test.txt","r",stdin);
int k1,k2,count,max;
double a[1010];
while(scanf("%d",&k1)!=EOF){
count=0;
max=-1;
memset(a,0,sizeof(a));
for(int i=0;i<k1;++i){
int temp1;
double temp2;
scanf("%d %lf",&temp1,&temp2);
a[temp1]+=temp2;
if(temp1>max)
max=temp1;
}
scanf("%d",&k2);
for(int i=0;i<k2;++i){
int temp1;
double temp2;
scanf("%d %lf",&temp1,&temp2);
a[temp1]+=temp2;
if(temp1>max)
max=temp1;
}
int xu=max;
while(xu>=0){
if(a[xu]!=0){
num[count].ni=xu;
num[count++].ani=a[xu];
}
xu--;
}
printf("%d",count);
for(int i=0;i<count;++i)
printf(" %d %.1lf",num[i].ni,num[i].ani);
printf("\n");
}
return 0;
}
PAT 1002. A+B for Polynomials
最新推荐文章于 2024-01-28 22:42:58 发布