求问为什么不对 ··· from bisect import bisect, bisect_left def solve(self, ): self.count = 0 r = sys.stdin.readlines() n = int(r[0][:-1]) a_list = [int(i) for i in sorted(r[1].split(), reverse=True)] b2_list = [int(i) for i in sorted(r[2].split())] b_mark = [0] * n count = 1 for i in range(n): bs = bisect_left(b2_list, a_list[i]) count *= ((n - bs) - i) return count % 100000007 ···