PATA1037题解

//
//  main.cpp
//  PATA1037
//
//  Created by Phoenix on 2018/2/10.
//  Copyright © 2018年 Phoenix. All rights reserved.
//

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;

int main(int argc, const char * argv[]) {
    int nc, np;
    scanf("%d", &nc);
    int num1[nc];
    for(int i = 0; i < nc; i++) {
        scanf("%d", &num1[i]);
    }
    scanf("%d", &np);
    int num2[np];
    for(int i = 0; i < np; i++) {
        scanf("%d", &num2[i]);
    }
    sort(num1, num1 + nc);
    sort(num2, num2 + np);
    int ans = 0;
    int i = 0, j = 0;
    while(num1[i] < 0 && num2[j] < 0 && i < nc && j < np) {
        ans += num1[i] * num2[j];
        i++;
        j++;
    }
    i = nc - 1; j = np - 1;
    while(num1[i] > 0 && num2[j] > 0 && i >= 0 && j >= 0) {
        ans += num1[i] * num2[j];
        i--;
        j--;
    }
    printf("%d",ans);
    return 0;
}