def partition(a,left,right):
    pivot = a[left]
    k = left + 1
    for i in range(left+1,right+1):
        if a[i]<pivot:
            a[k],a[i] = a[i],a[k]
            k += 1
    a[left],a[k-1] = a[k-1],a[left]
    return k-1
def quicksort(a,left,right):
    while left<right:
        mid = partition(a,left,right)
        quicksort(a,left,mid)
        quicksort(a,mid+1,right)
    return a

n,m = map(int,input().split())
a = list(map(int,input().split()))
b = quicksort(a)
print(" ".join(map(str,b)))

用插入排序过了60%，为什么用快速排序反而全都RE？？？跪求大佬指点