Cod sursa(job #723079)
Utilizator | Data | 24 martie 2012 21:26:11 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#include <algorithm>
using namespace std;
long M[3000005];
int main(void)
{
long N,K,i;
fstream fin("sdo.in",ios::in);
fstream fout("sdo.out",ios::out);
fin >> N >> K;
for (i = 0;i < N;i += 1)
{
fin >> M[i];
}
nth_element(M + 0,M + K - 1,M + N);
fout << M[K - 1] << " ";
fin.close();
fout.close();
return 0;
}