1037. Magic Coupon (25)

#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool cmp(int a,int b)
{
    return a>b;
}
int main()
{
    int nc,np;
    cin>>nc;
    int tmp;
    vector<int>a;
    vector<int>b;
    for(int i=0;i<nc;i++)
    {
        cin>>tmp;
        a.push_back(tmp);
    }
    cin>>np;
    for(int i=0;i<np;i++)
    {
        cin>>tmp;
        b.push_back(tmp);
    }
    sort(a.begin(),a.end(),cmp);
    sort(b.begin(),b.end(),cmp);
    int i=0,j=0;
    int sum=0;
    while(a[i]>0&&b[j]>0&&i<nc&&j<np)
    {
        sum+=a[i]*b[j];
        i++;
        j++;
    }
    int k=nc-1,l=np-1;
    while(a[k]<0&&b[l]<0&&k>=0&&l>=0)
    {
        sum+=a[k]*b[l];
        k--;
        l--;
    }
    cout<<sum<<endl;
}