Cod sursa(job #821946)
Utilizator | Paul Grigoras nimenia | Data | 22 noiembrie 2012 20:08:58 |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <algorithm>
#include <fstream>
#include <vector>
#define NMAX 3000001
using namespace std;
int nums[NMAX];
int main() {
ifstream in("sdo.in");
ofstream out("sdo.out");
long int n, k;
in >> n >> k;
for (long int i = 0 ; i < n; i++) {
in >> nums[i];
}
nth_element(nums, nums + k - 1, nums + n);
out << nums[k -1];
return 0;
}