A - On the Way

Time Limit: 2 sec / Memory Limit: 1024 MB

Score : 100 points

Problem Statement
There are three houses on a number line: House 1, 2 and 3, with coordinates A, B and C
, respectively. Print Yes if we pass the coordinate of House 3 on the straight way from House 1 to House 2 without making a detour, and print No otherwise.

Constraints0≤A,B,C≤100A, B and C are distinct integers.

Input
Input is given from Standard Input in the following format:A B C

Output
Print Yes if we pass the coordinate of House 3 on the straight way from House 1 to House 2 without making a detour, and print No otherwise.

Sample Input 1
3 8 5
Sample Output 1
Yes
We pass the coordinate
5
on the straight way from the house at coordinate
3
to the house at coordinate
8
.

Sample Input 2
7 3 1
Sample Output 2
No
Sample Input 3
10 2 4
Sample Output 3
Yes
Sample Input 4
31 41 59
Sample Output 4
No

就是看第三个数在不在第一个和第二个数之间

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<ctime>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<map>
#include<stack>
#include<queue>
#include<set>
#include<vector>
#define ll long long
#define dd double
using namespace std;

int main() {
	ll n, m, k;
	while (cin >> n >> m >> k) {
		ll t;
		if (m < n) {
			t = m;
			m = n;
			n = t;
		}
		if (k >= n && k <= m) {
			cout << "Yes" << endl;
		}
		else {
			cout << "No" << endl;
		}
	}
}