Cod sursa(job #821935)
Utilizator | Paul Grigoras nimenia | Data | 22 noiembrie 2012 19:59:05 |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <algorithm>
#include <fstream>
#include <vector>
#define NMAX 3000001
using namespace std;
int main() {
freopen("sdo.in", "r", stdin);
freopen("sdo.out", "w", stdout);
long int n, k;
scanf("%ld %ld", &n, &k);
vector<long int> nums;
for (long int i = 0 ; i < n; i++) {
long int num;
scanf("%ld", &num);
nums.push_back(num);
}
nth_element(nums.begin(), nums.begin() + k, nums.end());
printf("%ld", nums.at(k - 1));
return 0;
}