题解 | 田忌赛马

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 读取齐王的马匹速度
        int v1 = in.nextInt(), v2 = in.nextInt(), v3 = in.nextInt();
        // 读取田忌的马匹速度
        int a1 = in.nextInt(), a2 = in.nextInt(), a3 = in.nextInt();
        in.close();

        // 枚举田忌所有可能的出场顺序（共6种）
        int[][] orders = {
            {a1, a2, a3},
            {a1, a3, a2},
            {a2, a1, a3},
            {a2, a3, a1},
            {a3, a1, a2},
            {a3, a2, a1}
        };

        boolean canWin = false;
        for (int[] order : orders) {
            int win = 0;
            if (order[0] > v1) win++;
            if (order[1] > v2) win++;
            if (order[2] > v3) win++;
            if (win >= 2) {
                canWin = true;
                break;
            }
        }

        System.out.println(canWin ? "Yes" : "No");
    }
}