题解 | 田忌赛马

/*
 题目既然说了用暴力算法，那么只需依次调换tj数组的某两位，判断是否tjwin大于等于2，如果满足，终止循环。
如果不满足，那就一直循环，直到第三次交换
*/


#include <iostream>
#include<vector>
#include<algorithm>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    vector<int>qww(3);
    vector<int>tj(3);
    for (int i = 0; i < 3; i++) {
        cin >> qww[i];
    }
    for (int i = 0; i < 3; i++) {
        cin >> tj[i];
    }
    sort(tj.begin(), tj.end());
    int tjwin = 0;

    for (int i = 0; i < 3; i++) {
        if (tj[i] > qww[i]) {
            tjwin++;
        }
    }
    if (tjwin >= 2) {
        cout << "Yes" << '\n';
        return 0;
    }
    else {
        tjwin = 0;
        swap(tj[1], tj[2]);
        for (int i = 0; i < 3; i++) {
            if (tj[i] > qww[i]) {
                tjwin++;
            }
        }
        if (tjwin >= 2) {
            cout << "Yes" << '\n';
            return 0;
        }
        else {
            swap(tj[1], tj[2]);
            swap(tj[0], tj[1]);
            tjwin = 0;
            for (int i = 0; i < 3; i++) {
                if (tj[i] > qww[i]) {
                    tjwin++;
                }
            }
            if (tjwin >= 2) {
                cout << "Yes" << '\n';
                return 0;
            }
            else {
                swap(tj[0], tj[1]);
                swap(tj[0], tj[2]);
                tjwin = 0;
                for (int i = 0; i < 3; i++) {
                    if (tj[i] > qww[i]) {
                        tjwin++;
                    }
                }
                if (tjwin >= 2) {
                    cout << "Yes" << '\n';
                    return 0;
                }
                else {
                    cout << "No" << '\n';
                    return 0;
                }
            }

        }
        
    }




}
// 64 位输出请用 printf("%lld")