mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-11-30 23:36:26 +00:00
23 lines
347 B
C++
23 lines
347 B
C++
|
// R39029021
|
||
|
|
||
|
#include <bits/stdc++.h>
|
||
|
|
||
|
using namespace std;
|
||
|
|
||
|
int main() {
|
||
|
int n, a[10005], k;
|
||
|
cin >> n >> k;
|
||
|
for (int i = 0; i < n; i++) {
|
||
|
cin >> a[i];
|
||
|
}
|
||
|
sort(a, a + n);
|
||
|
n = unique(a, a + n) - a;
|
||
|
if (k >= n) {
|
||
|
cout << "NO RESULT" << endl;
|
||
|
}
|
||
|
else {
|
||
|
cout << a[--k];
|
||
|
}
|
||
|
return 0;
|
||
|
}
|