0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-24 18:31:59 +00:00

P1138 第k小整数

R39029021
This commit is contained in:
Baoshuo Ren 2020-09-29 20:52:45 +08:00 committed by Baoshuo Ren
parent b4f39098f2
commit 9cfc6a041d
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68

22
problem/P1138/P1138.cpp Normal file
View File

@ -0,0 +1,22 @@
// 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;
}