1037 Magic Coupon (25 分)难度: 简单 / 知识点: 排序 贪心

Posted 2021-10-12 辉小歌

https://pintia.cn/problem-sets/994805342720868352/problems/994805451374313472

#include<bits/stdc++.h>
using namespace std;
typedef long long int LL;
int n,m;
vector<LL>a1,a2;
vector<LL>b1,b2;
bool cmp(LL a,LL b) {return a>b;}
int main(void)
{
    cin>>n;
    for(int i=0;i<n;i++) 
    {
        int x; cin>>x;
        if(x>=0) a1.push_back(x);
        else a2.push_back(x);
    }
    cin>>m;
    for(int i=0;i<m;i++)
    {
        int x; cin>>x;
        if(x>=0) b1.push_back(x);
        else b2.push_back(x);
    }
    sort(a1.begin(),a1.end(),cmp);
    sort(a2.begin(),a2.end());
    sort(b1.begin(),b1.end(),cmp);
    sort(b2.begin(),b2.end());
    LL ans=0;
    for(int i=0,j=0;i<a1.size()&&j<b1.size();i++,j++) ans+=a1[i]*b1[j];
    for(int i=0,j=0;i<a2.size()&&j<b2.size();i++,j++) ans+=a2[i]*b2[j];
    cout<<ans;
    return 0;
}