线段交点问题

#include <iostream>
using namespace std;
#include <math.h>
int main()
{
    double A_x, A_y, B_x, B_y, C_x, C_y, D_x, D_y;
    cout << "Please input A_x,A_y" << endl;
    cin >> A_x >> A_y;
    cout << "Please input B_x,B_y" << endl;
    cin >> B_x >> B_y;
    cout << "Please input C_x,C_y" << endl;
    cin >> C_x >> C_y;
    cout << "Please input D_x,D_y" << endl;
    cin >> D_x >> D_y;
    if (min(A_x, B_x) <= max(C_x, D_x) && min(A_y, B_y) <= max(C_y, D_y) && min(C_x, D_x) <= max(A_x, B_x) && min(C_y, D_y) <= max(A_y, B_y))
        cout << "They have a point" << endl;
    else
        cout << "They don't have a point" << endl;
    return 0;
}