Pagini recente » Cod sursa (job #2974383) | testinround1234 | Cod sursa (job #913700) | Clasamentul arhivei Infoarena Monthly | Cod sursa (job #2625816)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
FILE /* * fin,*/ * fout;
int v[3000005];
int main() {
//fin = fopen("sdo.in","r");
fout = fopen("sdo.out","w");
int N, K;
//fscanf(fin,"%d%d",&N,&K);
ifstream fin("sdo.in");
fin >> N >> K;
for ( int i = 1; i <= N; i++ ){
//fscanf(fin,"%d",v+i);
fin >> v[i];
}
nth_element(v+1, v+K, v+N+1);
//cout << v[K] << "\n";
fprintf(fout,"%d",v[K]);
//fclose(fin);
fclose(fout);
return 0;
}