1037. Magic Coupon (25)

来源：互联网发布：人工智能的研究内容编辑：程序博客网时间：2024/06/03 23:46

题目：1037. Magic Coupon (25)

#include <iostream>#include <algorithm>#include <vector>using namespace std;int comp(int a,int b){    return a>b;}int comn(int a,int b){    return a<b;}int main(){    vector<int> vp1,vn1,vp2,vn2;    long money=0;    int n,x;    cin>>n;    while(n--)    {        cin>>x;        if(x>=0)            vp1.push_back(x);        else            vn1.push_back(x);    }    cin>>n;    while(n--)    {        cin>>x;        if(x>=0)            vp2.push_back(x);        else            vn2.push_back(x);    }    sort(vp1.begin(),vp1.end(),comp);    sort(vn1.begin(),vn1.end(),comn);    sort(vp2.begin(),vp2.end(),comp);    sort(vn2.begin(),vn2.end(),comn);    auto itvp1=vp1.begin();    auto itvp2=vp2.begin();    while(!vp1.empty()&&itvp1!=vp1.end()&&!vp2.empty()&&itvp2!=vp2.end())        money+=(*itvp1++)*(*itvp2++);    auto itvn1=vn1.begin();    auto itvn2=vn2.begin();    while(!vn1.empty()&&itvn1!=vn1.end()&&!vn2.empty()&&itvn2!=vn2.end())        money+=(*itvn1++)*(*itvn2++);    printf("%ld",money);    return 0;}

0 0