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
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
using ll = long long;

int main() {
	vector<int> a(18), b(18);
	ll sa = 0, sb = 0;
	for (auto &i : a) {
		cin >> i;
		sa += i;
	}
	for (auto &i : b) {
		cin >> i;
		sb += i;
	}

	string res[] = { "Algosia\n" , "Bajtek\n" };

	if (sa != sb) {
		cout << res[sa < sb];
		return 0;
	}

	sort(a.begin(), a.end());
	sort(b.begin(), b.end());
	reverse(a.begin(), a.end());
	reverse(b.begin(), b.end());

	for (int i = 0; i < 18; i++) {
		if (a[i] != b[i]) {
			cout << res[a[i] < b[i]];
			return 0;
		}
	}
	cout << "remis\n";
}