一、思路
对coupon和product降序排序;
进行从首到尾对两正数,及从尾到头对两负数求乘积,再累加;
二、代码
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
long long Nc, Np, sum = 0;
scanf("%lld", &Nc);
vector<long long> coupon(Nc);
for( long long i = 0; i < Nc; ++i )
scanf("%lld", &coupon[i]);
scanf("%lld", &Np);
vector<long long> product(Np);
for( long long i = 0; i < Np; ++i )
scanf("%lld", &product[i]);
sort( coupon.begin(), coupon.end(), [] (long long a, long long b) {return a > b;} );
sort( product.begin(), product.end(), [] (long long a, long long b) {return a > b;} );
for( int i = 0; i < min(Nc, Np) && coupon[i] > 0 && product[i] > 0; ++i )
sum += coupon[i] * product[i];
for( int i = 0; i < min(Nc, Np) && coupon[Nc - 1 - i] < 0 && product[Np - 1 - i] < 0; ++i )
sum += coupon[Nc - i - 1] * product[ Np - i - 1 ];
printf("%lld", sum);
}