#include <bits/stdc++.h>
using namespace std;
void solve(){
int n=18;
vector <int> A(n);
int sA=0, sB=0;
vector <int> B(n);
for (auto &i : A){
cin>>i;
sA+=i;
}
for (auto &i : B){
cin>>i;
sB+=i;
}
if(sA>sB){
cout<<"Algosia";
return;
}
if(sA<sB){
cout<<"Bajtek";
return;
}
sort(A.begin(),A.end());
sort(B.begin(),B.end());
for(int i=n-1;i>=0;i--){
if(A[i]>B[i]){
cout<<"Algosia";
return;
}
if(B[i]>A[i]) {
cout << "Bajtek";
return;
}
}
cout<<"remis";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
solve();
return 0;
}
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 | #include <bits/stdc++.h> using namespace std; void solve(){ int n=18; vector <int> A(n); int sA=0, sB=0; vector <int> B(n); for (auto &i : A){ cin>>i; sA+=i; } for (auto &i : B){ cin>>i; sB+=i; } if(sA>sB){ cout<<"Algosia"; return; } if(sA<sB){ cout<<"Bajtek"; return; } sort(A.begin(),A.end()); sort(B.begin(),B.end()); for(int i=n-1;i>=0;i--){ if(A[i]>B[i]){ cout<<"Algosia"; return; } if(B[i]>A[i]) { cout << "Bajtek"; return; } } cout<<"remis"; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); solve(); return 0; } |
English