题解 | 田忌赛马

#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};
    vector <int> perm = {0,1,2};
    bool canwin = false;
    do{
        int wins = 0;
        for(int i = 0; i < 3; ++i){
            if(tian[perm[i]] > king[i]){
                wins++;
            }
            if(wins >= 2){
                canwin = true;
                break;
            }
        }
    }
    while (next_permutation(perm.begin(), perm.end()));
    cout << (canwin ? "Yes" : "No") << endl;
}
// 64 位输出请用 printf("%lld")

C++数组打乱顺序比较