2019-12-21
14:29:21
#include <bits/stdc++.h> #include<math.h> using namespace std; const int MAX_LEN = 10001; int main(){ /*//A多项式,B多项式: vector<int,double> A(MAX_LEN); //初始化 for(int i=0;i<MAX_LEN;++i){ A[i]=0; } hash_map<int,double> B(MAX_LEN); for(int i=0;i<MAX_lEN;++i){ B[i]=0; } // int count = 0; cin>>count; for(int i=0;i<count;++i){ int fir = 0; double sec = 0; cin>>fir; cin>>sec; A[fir] = sec; } int count2=0; cin>>count2; for(int i =0;i<count2;++i){ int fir = 0; double sec = 0; cin>>fir; cin>>sec; B[fir] = sec; } // for(int i=0;i<MAX_LEN;++i){ if(A[i]!=0){ B[i] += A[i]; } } int count1 = 0; for(int i=0;i<MAX_LEN;++i){ if(B[i]!=0){ count1++; } } cout<<count1; for(int i=MAX_LEN-1;i>=0;--i){ if(B[i]!=0){ cout<<i<<B[i]<<" "; } }*/ //A,B: double A[MAX_LEN]={0}; double B[MAX_LEN]={0}; int count = 0; cin>>count; for(int i=0;i<count;++i){ int fir = 0; double sec = 0; cin>>fir; cin>>sec; A[fir] = sec; } int count2=0; cin>>count2; for(int i =0;i<count2;++i){ int fir = 0; double sec = 0; cin>>fir; cin>>sec; B[fir] = sec; } for(int i=0;i<MAX_LEN;++i){ if(A[i]!=0){ B[i] += A[i]; } } int count1 = 0; for(int i=0;i<MAX_LEN;++i){ if(B[i]!=0){ count1++; } } cout<<count1; for(int i=MAX_LEN-1;i>=0;--i){ if(B[i]!=0){ cout<<" "<<i<<" "<<B[i]; } } system("pause"); return 0; }
原文地址:https://www.cnblogs.com/JasonPeng1/p/12076846.html
时间: 2024-11-08 23:09:44