Cod sursa(job #2010746)
Utilizator | Data | 14 august 2017 11:32:48 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <algorithm>
#include <fstream>
using namespace std;
ifstream f ("sdo.in");
ofstream g ("sdo.out");
const int Dim = 3000005;
int n, k;
int v[Dim];
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';
return 0;
}