Pagini recente » Cod sursa (job #2057200) | Cod sursa (job #632314) | Istoria paginii runda/gr_3/clasament | Cod sursa (job #180764) | Cod sursa (job #662046)
Cod sursa(job #662046)
#include <fstream>
#include <stdlib.h>
#include <time.h>
#define vL 3000001
using namespace std;
ifstream in;
ofstream out;
int v[vL];
inline int quicksort(int L,int R)
{
int piv=L+rand()%(R-L+1),i,j;
for(i=L,j=R;i<j;)
{
for(;v[i]<piv;++i);
for(;v[j]>piv;--j);
if(i<j)
{
v[i]^=v[j];
v[j]^=v[i];
v[i]^=v[j];
}
if(i<=j)
{
++i;
--j;
}
}
return j;
}
inline void kmin(int L,int R,int K)
{
if(L==R) return;
int M=quicksort(L,R);
int len=M-L+1;
if(K>len) kmin(M+1,R,K-len);
else
if(K<len) kmin(L,M-1,K);
}
int main()
{
int N,K;
in.open("sdo.in");
in>>N>>K;
for(int i=1;i<=N;++i) in>>v[i];
in.close();
srand(time(NULL));
kmin(1,N,K);
out.open("sdo.out");
out<<v[K]<<'\n';
out.close();
return 0;
}