题解 | 田忌赛马

#include <stdio.h>
void sort(int arr[], int n) {
    for (int i = 0; i < n - 1; i++) {
        for (int j = 0; j < n - i - 1; j++) {
            if (arr[j] > arr[j + 1]) {
                int temp = arr[j + 1];
                arr[j + 1] = arr[j];
                arr[j] = temp;
            }
        }
    }
}
int main() {
    int l1[3];
    int l2[3];
    for (int i = 0; i < 3; i++) {
        scanf("%d", &l1[i]);
    }
    for (int i = 0; i < 3; i++) {
        scanf("%d", &l2[i]);
    }
    sort(l1, 3);
    sort(l2, 3);
    if (l2[2] > l1[1] && l2[2] > l1[0] && l2[1] > l1[0]) {
        printf("Yes");
    } else {
        printf("No");
    }
    return 0;
}