蓝桥杯基础试题 基础练习 矩形面积交 C++

差点就超时了……用的比较麻烦，排了两次序

#include<iostream>
#include<iomanip>
using namespace std;
void sort(double* a,int n) {
	double temp;
	for (int i = 0; i < n; i++) {
		for(int j=0;j<n-i-1;j++){
			if (a[j] > a[j + 1]) {
				temp = a[j]; a[j] = a[j + 1]; a[j + 1] = temp;
		}
		}
	}
}
void max(double &a,double &b){
	double temp;
	if (a > b) {
		temp = a;
		a = b; b = temp;
	}
}
int main() {
	double x1, y1, x2, y2,x3,y3,x4,y4;
	double sumX = 0, sumY = 0, sum=0;
	cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
	max(x1, x2); max(x3, x4); max(y1, y2); max(y3, y4);
	if(y3>y2||y4<y1||x3>x2||x4<x1){
		cout << setiosflags(ios::fixed) << setprecision(2)<<sum << endl;
	}
	else {
		double x[] = { x1,x2,x3,x4 };
		double y[] = { y1,y2,y3,y4 };
		sort(x, 4); sort(y,4);
		sumX = x[2] - x[1];
		sumY = y[2] - y[1];
		sum = sumY * sumX;
		cout << setiosflags(ios::fixed) << setprecision(2) << sum << endl;
	}
}