#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int n, k; cin >> n >> k; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } // 1. 排序 sort(a.begin(), a.end()); // 2. 去重 auto last = unique(a.begin(), a.end()); a.erase(last, a.end()); // 3. 判断并输出 if (k > a.size()) { cout << "No result" << endl; } else { cout << a[k - 1] << endl; } return 0; }