1037. Magic Coupon

#include <cstdio>
#include <algorithm>
#include <vector>

using namespace std ;

vector<long>C ;
vector<long>P ;

int main(void)
{

	int Nc , Np ;
	int i , j ;
	int sum = 0;
	int last = -1 ;

	//freopen("input.txt" , "r" , stdin);
	
	scanf("%d" , &Nc);

	while(Nc--)
	{
		long v ;
		scanf("%ld" , &v);
		C.push_back(v);
	}

	scanf("%d" , &Np);

	while(Np--)
	{
		long v ;
		scanf("%ld" , &v);
		P.push_back(v);
	}
	

	sort(C.begin() , C.end());
	sort(P.begin() , P.end());
	

	for( i =0 ; i < C.size(); i++)
	{
		if( C[i] < 0)
		{
			//´ÓÉϴηÃÎʵ㿪ʼ
			for( j = last + 1 ; j < P.size() ; j ++ )
			{
				if(P[j] >= 0 ) break ;
				
				//printf("%ld %ld\n" , C[i] , P[j]);

				sum = sum + C[i]*P[j] ;
				P[j] = 0 ;
				last = j ;

				break;
			}
		}

		else
		{
			break ;
		}
	}

	last = P.size();
	for( i = C.size() - 1 ; i >= 0 ; i --)
	{
		if( C[i] < 0 )break ;
		else
		{
			for( j =  last - 1; j >= 0 ; j -- )
			{
				if(P[j] <= 0 ) break ; ;
				
				//printf("%ld %ld\n" , C[i] , P[j]);

				sum = sum + C[i] * P[j] ;
				P[j] = 0 ;
				last = j ;
				break ;
			}
		}
	}

	printf("%ld\n" , sum);

	return 0 ;
}