简单的排序题,将两个数列的最大数值(都大于0)相乘,两个数列的最小数值(都小于0)相乘,即得结果
AC代码:
#include<iostream>
#include<vector>
#include<map>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<cstring>
#include<list>
#define inf 10000000
using namespace std;
int a[100005],b[100005];
int main()
{
int n1;
cin>>n1;
for(int i=0;i<n1;i++)
{
cin>>a[i];
}
sort(a,a+n1);
int n2;
cin>>n2;
for(int j=0;j<n2;j++)
{
cin>>b[j];
}
sort(b,b+n2);
int ans=0;
int it1=0;
int it2=0;
while(it1<n1&&it2<n2)
{
if(a[it1]<0&&b[it2]<0)
{
ans+=a[it1]*b[it2];
it1++;
it2++;
}
else
{
break;
}
}
it1=n1-1;
it2=n2-1;
while(it1>=0&&it2>=0)
{
if(a[it1]>0&&b[it2]>0)
{
ans+=a[it1]*b[it2];
it1--;
it2--;
}
else
{
break;
}
}
cout<<ans<<endl;
}