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
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <unordered_map>
#include <string>
#include <queue>
#include <deque>
#include <set>
#include <cstdlib>
#include <ctime>
#include<chrono>
#include<thread>
#include<iomanip>
#include<fstream>
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second

using namespace std;
int arrMalg[11];
int arrBaj[11];

int main()
{
    int sumBaj = 0, sumMalg = 0;
    for(int i = 0; i < 18; i++) {
        int a = 0;
        cin >> a;
        sumMalg += a;
        arrMalg[a]++;
    }
    for(int i = 0; i < 18; i++) {
        int a = 0;
        cin >> a;
        sumBaj += a;
        arrBaj[a]++;
    }
    if(sumBaj > sumMalg) cout << "Bajtek" << endl;
    else if(sumMalg > sumBaj) cout << "Algosia" << endl;
    else {
        for(int i = 10; i > 0; i--) {
            if(arrBaj[i] > arrMalg[i]) {
                cout << "Bajtek" << endl;
                return 0;
            }
            else if(arrMalg[i] > arrBaj[i]) {
                cout << "Algosia" << endl;
                return 0;
            }
        }
        cout << "remis" << endl;
    }
    return 0;
}