代码如下

#include <iostream>
#include <algorithm>
using namespace std;

int a[10010];

int main()
{
    int n, k;
    cin >> n >> k;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    sort(a + 1, a + n + 1);
    int x = 0;
    for (int i = 1; i <= n; i++)
    {
        if (a[i] != a[i - 1])
        {
            x++;
        }
        if (x == k)
        {
            cout << a[i] << endl;
            return 0;
        }
    }
}