Помогите Никите найти К-ю по полезности банку

n, k = map(int, input().split())
a = list(map(int, input().split()))
u = True
while u:
    u = False
    for j in range(n-1):
        if a[j] < a[j+1]:
            a[j], a[j+1] = a[j+1], a[j]
            u = True
    n -= 1
print(a[k-1])

import queue
q = queue.PriorityQueue()
n, k = map(int, input().split())
for x in input().split():
    q.put(int(x))
    if q.qsize() > k:
        q.get()
print(q.get())

n, k = map(int, input().split())
a = list(map(int, input().split()))
for i in range(len(a)):
    score = 0
    m = a[i]
    for j in range(len(a)):
        if a[j] > m :
            score += 1
    if score == k-1:
        print(a[i])
        break

def selection_sort(a):
    for i in range(min((len(a) - 1),100)):
        imax = i
        for j in range(i + 1, len(a)):
            if a[j] > a[imax]:
                imax = j
        a[i], a[imax] = a[imax], a[i]
    return a
biba,boba=list(map(int,input().split()))
a=list(map(int,input().split()))
print(selection_sort(a)[boba-1])

n,k = map(int,input().split())
 
arr = list(map(int,input().split()))
 
def selection_sort_reversed_optimised (arr,k):
 
    for i in range (len(arr)):
        idle = i
        
        for j in range (i, len(arr)):
            if (arr[idle] < arr[j]):
                idle = j
        arr[i], arr[idle] = arr[idle], arr[i]
        if (i == k-1):
            return arr[:i+1]
 
print (selection_sort_reversed_optimised(arr,k)[k-1])

n, k = map(int, input().split())
a = list(map(int, input().split()))
used_maximum = set()
for i in range(k):
    maximum = -1
    index_of_maximum = 0
    for j in range(n):
        if ((j not in used_maximum) and (a[j] > maximum)):
            maximum = a[j]
            index_of_maximum = j
    used_maximum.add(index_of_maximum)
print(maximum)