题解 | 田忌赛马

//穷举
#include <bits/stdc++.h>
using namespace std;

int main()
{

    ios::sync_with_stdio(false);
    cin.tie(0);
    int v[3],a[3];

    for(size_t i = 0; i < 3; i++) cin >> v[i];
    for(size_t i = 0; i < 3; i++) cin >> a[i];

    sort(a,a+3);
    
    bool can_win = false;
    do {
        int wins{0};
        for(int i = 0;i<3;i++)
        {
            if(a[i] > v[i])
            {
                wins++;
            }
        }

        if(wins >= 2)
        {
            can_win = true;
            break;
        }

    }while (next_permutation(a,a+3));

    if(can_win) cout << "Yes" << endl;
    else cout << "No" << endl;
    

    return 0;
}