pat1037 Magic Coupon

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<cstring>
#include<cmath>
#include<map>
#include<stack>
#define N 100005
#define ll long long
using namespace std;
int a[N],b[N];
int main()
{
	int n,m,i,j;
	while(scanf("%d",&n)!=EOF)
	{
		for(i = 0;i<n;i++)scanf("%d",&a[i]);
		scanf("%d",&m);
		for(i = 0;i<m;i++)scanf("%d",&b[i]);
		sort(a,a+n);
		sort(b,b+m);
		ll ans = 0;
		i = j = 0;
		while(i<n&&j<m)
		{
			if(a[i]<0&&b[j]<0)ans+=(ll)a[i]*(ll)b[j];
			else break;
			i++,j++;
		}
		i = n-1,j = m-1;
		while(i>=0&&j>=0)
		{
			if(a[i]>0&&b[j]>0)ans+=(ll)a[i]*(ll)b[j];
			else break;
			i--,j--;
		}
		printf("%lld\n",ans);
	}
    return 0;
}