Cod sursa(job #1377779)
Utilizator | Oprea Sebastian oprea1si2si3 | Data | 6 martie 2015 01:38:51 |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#include <algorithm>
using namespace std;
const int kNMax = 3000010;
int n, k, v[kNMax];
void Citire() {
ifstream in("sdo.in");
in >> n >> k;
for (int i = 1; i <= n; ++i)
in >> v[i];
in.close();
}
void Afisare() {
ofstream out("sdo.out");
out << v[k] << '\n';
out.close();
}
int main() {
Citire();
nth_element(v + 1, v + k, v + n + 1);
Afisare();
return 0;
}