Cod sursa(job #429135)
Utilizator | Data | 29 martie 2010 20:54:22 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <algorithm>
#include <fstream>
using namespace std;
const int MAX_N = 3000000;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int n, k;
int v[MAX_N];
int main() {
fin >> n >> k;
for (int i = 0; i < n; ++i)
fin >> v[i];
--k;
nth_element(v, v + k, v + n);
fout << v[k];
}