Cod sursa(job #930444)
Utilizator | Data | 27 martie 2013 17:29:15 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("sdo.in"); ofstream g("sdo.out");
const int NMAX = 3000003;
int n, k, v[NMAX];
int main() {
f >> n >> k;
for(int i = 1; i <= n; ++i) f >> v[i];
nth_element(v + 1, v + k, v + n + 1);
g << v[k] << '\n';
g.close();
return 0;
}