这个

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

int main() {
int n, k;
cin >> n >> k;

vector<int> nums(n);
for (int i = 0; i < n; ++i) {
    cin >> nums[i];
}


sort(nums.begin(), nums.end());
nums.erase(unique(nums.begin(), nums.end()), nums.end());


if (k > nums.size()) {
    cout << "NO RESULT" << endl;
} else {
    cout << nums[k - 1] << endl;  
}

return 0;

}