这个码1WA 3RE 为啥呀qwq

def quick_sort(array, left, right):
    if left >= right:
        return
    pivot = array[left]
    low = left
    high = right
    while low < high:
        while low < high and (pivot[2] < array[high][2] or (pivot[2] == array[high][2] and pivot[1] < array[high][1])):
            high -= 1
        array[low] = array[high]
        while low < high and (pivot[2] > array[low][2] or (pivot[2] == array[low][2] and pivot[1] >= array[low][1])):
            low += 1
        array[high] = array[low]
    array[low] = pivot
    quick_sort(array, left, low - 1)
    quick_sort(array, low + 1, right)


n = int(input())
minister = []
king = list(map(int, input().split()))
for i in range(n):
    list_1 = list(map(int, input().split()))
    minister.append([list_1[0], list_1[1], list_1[0] * list_1[1]])
quick_sort(minister, 0, n - 1)
ans = 0
multiply = king[0]
for i in range(n):
    if int(multiply / minister[i][1]) > ans:
        ans = int(multiply / minister[i][1])  # 问题：没有考虑两者左右手金币乘积相同的情况。
    multiply *= minister[i][0]
print(ans)
# print(minister)