#include <iostream> #include <vector> #include <algorithm> using namespace std; int main(){ ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0); int n=18; vector<int>a(n),b(n); int sa=0,sb=0; for(auto&i:a){cin>>i;sa+=i;} for(auto&i:b){cin>>i;sb+=i;} if(sa>sb){ cout<<"Algosia\n"; return 0; } if(sb>sa){ cout<<"Bajtek\n"; 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<n;i++){ if(a[i]>b[i]){ cout<<"Algosia\n"; return 0; } else if(b[i]>a[i]){ cout<<"Bajtek\n"; return 0; } } cout<<"remis\n"; 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 | #include <iostream> #include <vector> #include <algorithm> using namespace std; int main(){ ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0); int n=18; vector<int>a(n),b(n); int sa=0,sb=0; for(auto&i:a){cin>>i;sa+=i;} for(auto&i:b){cin>>i;sb+=i;} if(sa>sb){ cout<<"Algosia\n"; return 0; } if(sb>sa){ cout<<"Bajtek\n"; 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<n;i++){ if(a[i]>b[i]){ cout<<"Algosia\n"; return 0; } else if(b[i]>a[i]){ cout<<"Bajtek\n"; return 0; } } cout<<"remis\n"; return 0; } |