Cod sursa(job #1207769)
Utilizator | Data | 13 iulie 2014 20:23:51 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
using namespace std;
#include <fstream>
#include <algorithm>
ifstream fin("sdo.in");
ofstream fout("sdo.out");
const int Nmax = 3000000;
int v[Nmax];
int main()
{
int i, n, k;
fin >> n >> k;
for(i = 0; i < n; ++i) fin >> v[i];
nth_element(v, v + k - 1, v + n);
fout << v[k - 1] << '\n';
return 0;
}