algorithm_study/CompatiblePair.cpp at master · wonjerry/algorithm_study · GitHub

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
44
45
46
47
48
49
50
#include <iostream>
#include <cstdio>

using namespace std;

int main() {
    int n, m;

    scanf("%d %d", &n, &m);
    int *tommy = new int[n];
    int *banban = new int[m];

    for(int i = 0; i < n; i++) {
        scanf("%d", &tommy[i]);
    }

    for(int i = 0; i < m; i++) {
        scanf("%d", &banban[i]);
    }

    int index = 0;
    long long max = (long long) tommy[0] * banban[0];

    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            long long temp = (long long) tommy[i] * banban[j];

            if(max < temp) {
                max = temp;
                index = i;
            }
        }
    }

    max = (long long) tommy[index == 0 ? 1 : 0] * banban[0];
    for(int i = 0; i < n; i++) {
        if(i == index) continue;
        for(int j = 0; j < m; j++) {
            long long temp = (long long) tommy[i] * banban[j];

            if(max < temp) {
                max = temp;
            }
        }
    }

    printf("%I64d\n", max);

    return 0;
}