算法1
时间复杂度
参考文献
py 代码
a = list(map(int,input().split()))
b = list(map(int,input().split()))
def quik_sort(nums):
if len(nums) <= 1:
return nums
x = nums[len(nums)//2]
left = [i for i in nums if i < x]
mid = [i for i in nums if i == x]
right = [i for i in nums if i > x]
return quik_sort(left) + mid + quik_sort(right)
b = quik_sort(b)
print(b[a[1]-1])