Cod sursa(job #1028139)
Utilizator | Data | 13 noiembrie 2013 18:04:37 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int X[3000005],N,K;
int main()
{
fin>>N>>K;
for(int i=1;i<=N;i++)
fin>>X[i];
nth_element(X+1,X+K,X+N+1);
fout<<X[K]<<'\n';
return 0;
}