Sample Input:
2 1 2.4 0 3.2
2 2 1.5 1 0.5
Sample Output:
3 3 3.6 2 6.0 1 1.6
还是用map做的,还是做复杂了,用普通的数组直接做就挺好的
用map反而不好处理细节
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
int m;
map<int ,double>a;
map<int,double>b;
map<int,double,greater<int>>c;
cin>>n;
int t;
double tt;
for(int i=0;i<n;i++){
cin>>t;
cin>>tt;
a[t]=tt;
}
cin>>m;
for(int i=0;i<m;i++){
cin>>t;
cin>>tt;
b[t]=tt;
}
for(auto x:a){
for(auto y:b){
t=x.first+y.first;
tt=x.second*y.second;
if(tt!=0)
c[t]+=tt;
}
}
for(auto x:c){
// cout<<x.first<<' '<<x.second;
if(x.second==0)
c.erase(x.first);
// printf(" %d %.1f",x.first,x.second);
}
cout<<c.size();
for(auto x:c){
// cout<<x.first<<' '<<x.second;
if(x.second==0)
c.erase(x.first);
printf(" %d %.1f",x.first,x.second);
}
return 0;
}
还是附上大神的代码吧
https://blog.csdn.net/liuchuo/article/details/52109341
#include <iostream>
using namespace std;
int main() {
int n1, n2, a, cnt = 0;
scanf("%d", &n1);
double b, arr[1001] = {0.0}, ans[2001] = {0.0};
for(int i = 0; i < n1; i++) {
scanf("%d %lf", &a, &b);
arr[a] = b;
}
scanf("%d", &n2);
for(int i = 0; i < n2; i++) {
scanf("%d %lf", &a, &b);
for(int j = 0; j < 1001; j++)
ans[j + a] += arr[j] * b;
}
for(int i = 2000; i >= 0; i--)
if(ans[i] != 0.0) cnt++;
printf("%d", cnt);
for(int i = 2000; i >= 0; i--)
if(ans[i] != 0.0)
printf(" %d %.1f", i, ans[i]);
return 0;
}