快排-python

# 递归
def quick_sort(l,left,right):
    if left>=right:
        return
    i=left-1
    j=right+1
    mid=l[(left+right)//2]
    while i<j:
        while 1:
            i+=1
            if l[i]>=mid:
                break
        while 1:
            j-=1
            if l[j]<=mid:
                break
        if i<j:
            l[i],l[j]=l[j],l[i]
    quick_sort(l,left,j)
    quick_sort(l,j+1,right)

# 分治
def quick_sort(nums):
    if (len(nums))<=1:
        return nums
    left=[]
    right=[]
    mid=[]
    prvot=nums[(len(nums))//2]
    for x in nums:
        if x<prvot:
            left.append(x)
        elif x>prvot:
            right.append(x)
        else :
            mid.append(x)
    return quick_sort(left)+mid+quick_sort(right)


n,k=map(int,input().split())
l=[int(i) for i in input().split()]
l=quick_sort(l)
print(l[k-1])