1037. Magic Coupon (25)

#include <iostream>#include <cstdio>#include <vector>#include <algorithm>using namespace std;vector<int> couponP;vector<int> couponN;vector<int> productP;vector<int> productN;int main(){int nc, np;scanf("%d", &nc);for(int i = 0; i < nc; ++i){int c;scanf("%d", &c);if(c < 0) couponN.push_back(c);else couponP.push_back(c);}scanf("%d", &np);for(int i = 0; i < np; ++i){int p;scanf("%d", &p);if(p < 0) productN.push_back(p);else productP.push_back(p);}sort(couponP.rbegin(), couponP.rend());sort(couponN.begin(), couponN.end());sort(productP.rbegin(), productP.rend());sort(productN.begin(), productN.end());long long sum = 0;for(size_t i = 0; i < couponP.size() && i < productP.size(); ++i)sum += couponP[i] * productP[i];for(size_t i = 0; i < couponN.size() && i < productN.size(); ++i)sum += couponN[i] * productN[i];cout << sum;return 0;}