HDoj 2056 Rectangles

#include <iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
    double x[4];
    double y[4];
    while(scanf("%lf%lf%lf%lf%lf%lf%lf%lf",&x[0],&y[0],&x[1],&y[1],&x[2],&y[2],&x[3],&y[3]) !=EOF )
    {
        if( (min(x[0],x[1])>max(x[2],x[3]))  ||  (max(x[0],x[1])<min(x[2],x[3])) )         //首先排除两个矩形左右错开，此时面积为0
        {
            printf("0.00\n");
            continue;
        }
        if( (min(y[0],y[1])>max(y[2],y[3]))  ||  (max(y[0],y[1])<min(y[2],y[3])) )         //排除两个矩形上下错开，此时面积为0
        {
            printf("0.00\n");
            continue;
        }
        sort(x,x+4);
        sort(y,y+4);
        printf("%.2lf\n",(x[2]-x[1])*(y[2]-y[1]));
    }
}