题解 | 田忌赛马

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

int main() {
    int v1, v2, v3;
    int a1, a2, a3;
    cin >> v1 >> v2 >> v3;
    cin >> a1 >> a2 >> a3;
    
    vector<int> k = {v1, v2, v3};
    vector<int> t = {a1, a2, a3};
    
    sort(t.begin(), t.end());
    bool win = false;
    
    do {
        int wins = 0;
        for (int i = 0; i < 3; ++i) {
            if (t[i] > k[i]) {
                wins++;
            }
        }
        if (wins >= 2) {
            win = true;
            break;
        }
    } while (next_permutation(t.begin(), t.end()));
    
    cout << (win ? "Yes" : "No") << endl;
    return 0;
}