This time, you are supposed to find A+B where A and B are two polynomials.
Input Specification:
Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial:
K N1 aN1 N2 aN2 ... NK aNK
where K is the number of nonzero terms in the polynomial, Ni and aNi (i=1,2,⋯,K) are the exponents and coefficients, respectively. It is given that 1≤K≤10,0≤NK<⋯<N2<N1≤1000.
Output Specification:
For each test case you should output the sum of A and B in one line, with the same format as the input. Notice that there must be NO extra space at the end of each line. Please be accurate to 1 decimal place.
Sample Input:
2 1 2.4 0 3.2
2 2 1.5 1 0.5
Sample Output:
3 2 1.5 1 2.9 0 3.2
solution:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
int main()
{
int t=2;
map<int,double>mp;
while(t--)
{
int k;cin>>k;
while(k--)
{
int a;double b;cin>>a>>b;
mp[a]+=b;
}
}
vector<pair<int,double> >ans(mp.begin(),mp.end());
sort(ans.begin(),ans.end(),[](pair<int,double>a,pair<int,double>b)
{
return a.first>b.first;
});
int cnt=0;
for(auto i:mp)//如果系数为0,则不计入
{
if(i.second)cnt++;
}
cout<<cnt;
for(auto i:ans)
{
if(i.second)//系数不为0
printf(" %d %.1f",i.first,i.second);
}
}