题解 | 田忌赛马

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    int v1, v2, v3;
    cin >> v1 >> v2 >> v3;
    vector<int> king = {v1, v2, v3};
    
    int a1, a2, a3;
    cin >> a1 >> a2 >> a3;
    vector<int> tian = {a1, a2, a3};
    
    // 生成田忌马匹的所有可能排列
    sort(tian.begin(), tian.end());
    bool canWin = false;
    do {
        int wins = 0;
        for (int i = 0; i < 3; ++i) {
            if (tian[i] > king[i]) {
                wins++;
            }
        }
        if (wins >= 2) {
            canWin = true;
            break;
        }
    } while (next_permutation(tian.begin(), tian.end()));
    
    cout << (canWin ? "Yes" : "No") << endl;
    return 0;
}