Go 解法, 执行用时: 923ms, 内存消耗: 5960K, 提交时间: 2023-08-13 13:34:30

package main
import (
    "fmt"
    "sort"
)

func main() {
    n, k := 0, 0
    fmt.Scanf("%d %d",&n, &k)
    ans := make([]int, n)
    
    for i := 0; i < n; i++ {
        fmt.Scanf("%d", &ans[i])
    }
    
    sort.Ints(ans)
    
    fmt.Printf("%d", ans[k-1])
    return
}

Python3 解法, 执行用时: 115ms, 内存消耗: 16224K, 提交时间: 2023-08-13 13:33:49

n, k = map(int, input().split())
arr = [int(v) for v in input().split()]
arr.sort()
print(arr[k-1])