题解 | 田忌赛马

#include <stdio.h>
#include <stdlib.h>

int compare1(const void* a, const void* b) {
    return(*(int*)a - *(int*)b);
}   //田忌

int compare2(const void* a, const void* b) {
    return(*(int*)b - *(int*)a);
}   //齐王

int main(void) {
    int a[3], v[3];

    for (int i = 0; i < 3; i++) {
        scanf("%d", &v[i]);
    }   //齐王

    for (int i = 0; i < 3; i++) {
        scanf("%d", &a[i]);
    }   //田忌

    qsort(a, 3, sizeof(int), compare1);
    qsort(v, 3, sizeof(int), compare2);

    int temp = a[2];
    a[2] = a[1];
    a[1] = temp;

    int count = 0;
    for (int i = 0; i < 3; i++) {
        if (v[i] < a[i])
            count++;
    }
    if (count >= 2)
        printf("Yes");
    else
        printf("No");

    return 0;
}