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
51
52
53
54
55
56
57
58
59
60
#include <iostream>
#include <vector>
#include <string>
#include <numeric>
#include <algorithm>

int main()
{
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(NULL);

    const int n = 18;

    std::vector<int> Algosia(n, 0);
    std::vector<int> Bajtek(n, 0);

    for (int i = 0; i < n; i++)
    {
        std::cin >> Algosia[i];
    }
    for (int i = 0; i < n; i++)
    {
        std::cin >> Bajtek[i];
    }

    int algosiaPoints = 0;
    int bajtekPoints = 0;

    algosiaPoints = std::reduce(Algosia.begin(), Algosia.end());
    bajtekPoints = std::reduce(Bajtek.begin(), Bajtek.end());

    if (algosiaPoints > bajtekPoints)
    {
        std::cout << "Algosia" << std::endl;
    }
    else if (algosiaPoints < bajtekPoints)
    {
        std::cout << "Bajtek" << std::endl;
    }
    else {
        std::sort(Algosia.begin(), Algosia.end(), std::greater<int>());
        std::sort(Bajtek.begin(), Bajtek.end(), std::greater<int>());

        for (int i = 0; i < n; i++)
        {
            if (Algosia[i] > Bajtek[i])
            {
                std::cout << "Algosia" << std::endl;
                return 0;
            }
            else if (Algosia[i] < Bajtek[i])
            {
                std::cout << "Bajtek" << std::endl;
                return 0;
            }
        }

        std::cout << "remis" << std::endl;
    }
}