23蓝桥b组Java题
import java.util.Arrays
import java.util.Comparator
import java.util.Scanner
public class main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in)
Long [][]arr = new Long[2][4]
for (int i = 0
for (int j = 0
arr[i][j] = scan.nextLong()
}
}
Arrays.sort(arr, Comparator.comparingLong(o -> o[0]))
long sum = 0
sum += (arr[0][2]-arr[0][0])*(arr[0][3]-arr[0][1])
sum += (arr[1][2]-arr[1][0])*(arr[1][3]-arr[1][1])
if (arr[1][0]>=arr[0][2]) {
System.out.println(sum)
} else{//求重叠区域
long res = 0
long x1 =arr[1][0]
long y1 = Math.max(arr[0][1],arr[1][1])
long x2 = Math.min(arr[0][2],arr[1][2])
long y2 = Math.min(arr[0][3],arr[1][3])
res = (y2-y1)*(x2-x1)
System.out.println(sum-res)
}
}
}