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
#include <cstdio>
#include <cstdlib>

int main() {
    int asum = 0;
    int bsum = 0;
    int aranks[11] = {0};
    int branks[11] = {0};

    for (int i = 0; i < 18; i++) {
        int x;
        scanf("%d", &x);
        asum += x;
        aranks[x]++;
    }

    for (int i = 0; i < 18; i++) {
        int x;
        scanf("%d", &x);
        bsum += x;
        branks[x]++;
    }

    if (asum > bsum) {
        puts("Algosia");
        return 0;
    } else if (asum < bsum) {
        puts("Bajtek");
        return 0;
    } else {
        for (int i = 10; i >= 0; i--) {
            if (aranks[i] > branks[i]) {
                puts("Algosia");
                return 0;
            } else if (aranks[i] < branks[i]) {
                puts("Bajtek");
                return 0;
            }
        }

        puts("remis");
        return 0;
    }
}