蓝桥杯--矩阵面积交

http://47.104.209.207/problem/old1060

计算出相交矩阵的左下和右上两个顶点。

#include<cmath>
#include<iostream>
#include<queue>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
    double x1,y1,x2,y2;
    double x3,y3,x4,y4;
    cin>>x1>>y1>>x2>>y2;
    cin>>x3>>y3>>x4>>y4;
    double m1=max(min(x1,x2),min(x3,x4));
    double n1=max(min(y1,y2),min(y3,y4));
    double m2=min(max(x1,x2),max(x3,x4));
    double n2=min(max(y1,y2),max(y3,y4));
    if(m2>m1&&n2>n1){
        printf("%.2f",(double)(m2-m1)*(n2-n1));
    }else{
        printf("%.2f",0);
    }
    return 0;
}