A1037 Magic Coupon (25 分)

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cctype>
using namespace std;
typedef long long ll;

int main(){	
	int Nc, Np;
	ll cou[100010], pro[100010];
	scanf("%d", &Nc);
	for(int i = 0; i < Nc; i++){
		scanf("%lld", &cou[i]);
	}
	scanf("%d", &Np);
	for(int i = 0; i < Np; i++){
		scanf("%lld", &pro[i]);
	}
	sort(cou, cou+Nc);
	sort(pro, pro+Np);
	ll sum = 0;
	for(int i = 0; i < Nc && i < Np; i++){
		if(cou[i] < 0 && pro[i] < 0){
			sum += cou[i] * pro[i];
		}else break;
	}
	int R1 = Nc - 1, R2 = Np - 1;
	while(R1 >= 0 && R2 >= 0){
		if(cou[R1] > 0 && pro[R2] > 0){
			sum += cou[R1] * pro[R2];
			R1--; R2--;
		}else break;
	}		
	printf("%lld", sum);
	return 0;
}