题解 | 田忌赛马
田忌赛马
https://www.nowcoder.com/practice/49d799f65a0749588e9cd7e6135a4a9a
#include<stdio.h>
#include<stdlib.h>
int cmp(const void *a,const void *b){
return *(int *)a-*(int *)b;
}
int main(){
int arr[3];
int ayy[3];
for(int i=0;i<3;i++){
scanf("%d",&arr[i]);
}
for(int i=0;i<3;i++){
scanf("%d",&ayy[i]);
}
qsort(arr,3,sizeof(arr[0]),cmp);
qsort(ayy,3,sizeof(arr[0]),cmp);
if(ayy[2]>arr[1]&&ayy[1]>arr[0]){
printf("Yes");
}
else{
printf("No");
}
return 0;
}
