#include <iostream> #include <vector> #include <algorithm> #include <numeric> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); vector<int>A(18), B(18); for (int i=0; i<18; i++) cin >> A[i]; for (int i=0; i<18; i++) cin >> B[i]; int sumA = accumulate(A.begin(), A.end(), 0); int sumB = accumulate(B.begin(), B.end(), 0); if (sumA != sumB) { cout << ((sumA<sumB) ? "Bajtek\n" : "Algosia\n"); return 0; } sort(A.begin(), A.end()); sort(B.begin(), B.end()); for (int i=17; i>=0; i--) if (A[i] != B[i]) { cout << ((A[i]<B[i]) ? "Bajtek\n" : "Algosia\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 | #include <iostream> #include <vector> #include <algorithm> #include <numeric> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); vector<int>A(18), B(18); for (int i=0; i<18; i++) cin >> A[i]; for (int i=0; i<18; i++) cin >> B[i]; int sumA = accumulate(A.begin(), A.end(), 0); int sumB = accumulate(B.begin(), B.end(), 0); if (sumA != sumB) { cout << ((sumA<sumB) ? "Bajtek\n" : "Algosia\n"); return 0; } sort(A.begin(), A.end()); sort(B.begin(), B.end()); for (int i=17; i>=0; i--) if (A[i] != B[i]) { cout << ((A[i]<B[i]) ? "Bajtek\n" : "Algosia\n"); return 0; } cout << "remis\n"; return 0; } |