1002 A+B for Polynomials (25 分)
1002 A+B for Polynomials (25 分)
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
代码如下
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
map<int, double, greater<int>> m;
int n;
cin >> n;
while (n--)
{
int a;
double b;
cin >> a >> b;
m[a] += b;
}
cin >> n;
while (n--)
{
int a;
double b;
cin >> a >> b;
m[a] += b;
}
int cnt = m.size();
for (auto i = m.begin(); i != m.end(); i++)
{
if (i->second == 0)
{
cnt--;
}
}
cout << cnt;
for (auto i = m.begin(); i != m.end(); i++)
{
if (i->second != 0)
{
printf(" %d %.1lf", i->first, i->second);
}
}
}