-
Notifications
You must be signed in to change notification settings - Fork 1
/
A1037.cpp
43 lines (39 loc) · 1.02 KB
/
A1037.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
/*
* hint:
* 测试点1,5:考察当 coupon 中正数(负数)和 product 中正数(负数)个数相等时的处理
*/
#include <iostream>
#include <algorithm>
#define MAXN 100005
using namespace std;
long long coupon[MAXN], product[MAXN];
bool cmp(long long a, long long b)
{
return a > b;
}
int main()
{
int nc, np;
scanf("%d", &nc);
for (int i = 0; i < nc; i++)
scanf("%lld", &coupon[i]);
scanf("%d", &np);
for (int i = 0; i < np; i++)
scanf("%lld", &product[i]);
long long ans = 0;
int minlen = min(nc, np);
sort(coupon, coupon + nc);
sort(product, product + np);
for (int i = 0; i < minlen; i++)
if (coupon[i] < 0 && product[i] < 0)
ans += coupon[i] * product[i];
else break;
sort(coupon, coupon + nc, cmp);
sort(product, product + np, cmp);
for (int i = 0; i < minlen; i++)
if (coupon[i] > 0 && product[i] > 0)
ans += coupon[i] * product[i];
else break;
printf("%d", ans);
return 0;
}