蓝桥杯 矩形面积交

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 int main() {
 4     double x[4];
 5     double y[4];
 6     for (int i = 0; i < 4; i++) {
 7         cin >> x[i] >> y[i];
 8     }
 9     sort(x, x + 2);
10     sort(x + 2, x + 4);
11     sort(y, y + 2);
12     sort(y + 2, y + 4);
13     if (x[0] >= x[3] || x[1] <= x[2] || y[0] >= y[3] || y[1] <= y[2]) {
14         cout << "0.00" << endl;
15     } else {
16         sort(x, x + 4);
17         sort(y, y + 4);
18         cout << fixed << setprecision(2) << (x[2] - x[1]) * (y[2] - y[1]) << endl;
19     }
20     return 0;
21 }