PAT 1037

蛋疼题目系列

把正数和负数都排一遍序，然后就ok了

#include <vector>
#include <iostream>
#include <string>
#include <fstream>
#include <queue>
#include <algorithm>

using namespace std;

struct ComLarge{
    bool operator()(const int i1, const int i2){
        return i1 > i2;
    }
};

struct ComSmall{
    bool operator()(const int i1, const int i2){
        return i1 < i2;
    }
};

//#define OJ

#ifdef OJ
#define fin cin
#endif

int main(){
#ifndef OJ
    ifstream fin("in.data");
#endif

    vector<int> pos_coupon;
    vector<int> neg_coupon;
    vector<int> pos_val;
    vector<int> neg_val;

    int NC, NP, val;
    fin >> NC;
    for (int i = 0; i < NC; i++){
        fin >> val;
        if (val > 0)
            pos_coupon.push_back(val);
        else
            neg_coupon.push_back(val);
    }
    fin >> NP;
    for (int i = 0; i < NP; i++){
        fin >> val;
        if (val > 0)
            pos_val.push_back(val);
        else
            neg_val.push_back(val);
    }

    sort(pos_coupon.begin(), pos_coupon.end(), ComLarge());
    sort(pos_val.begin(), pos_val.end(), ComLarge());
    sort(neg_coupon.begin(), neg_coupon.end(), ComSmall());
    sort(neg_val.begin(), neg_val.end(), ComSmall());

    int pos_cnt = (pos_coupon.size() < pos_val.size() ? pos_coupon.size() : pos_val.size());
    int neg_cnt = (neg_coupon.size() < neg_val.size() ? neg_coupon.size() : neg_val.size());

    int total = 0;
    for (int i = 0; i < pos_cnt; i++)
        total += pos_coupon[i] * pos_val[i];
    for (int i = 0; i < neg_cnt; i++)
        total += neg_coupon[i] * neg_val[i];

    cout << total << endl;

    return 0;
}