PAT（甲级）A+B for Polynomials

题目：https://www.patest.cn/contests/pat-a-practise/1002

代码：

#include<cstdio>#include<cstring>#include<cstdlib>#include<algorithm>using namespace std;int main(){ int n1,n2,t,i,max=0,count=0;double temp;double s[1111]={};scanf("%d",&n1);for(i=0;i<n1;i++){scanf("%d %lf",&t,&temp);s[t]+=temp;if(t>max)  max=t;}scanf("%d",&n2);for(i=0;i<n2;i++){scanf("%d %lf",&t,&temp);s[t]+=temp;if(t>max)  max=t;}for(i=max;i>=0;i--){if(s[i]!=0)count++;}printf("%d",count);for(i=max;i>=0;i--){if(s[i]!=0){printf(" %d %.1lf",i,s[i]);}}system("pause");}