Pagini recente » Cod sursa (job #1479468) | Cod sursa (job #2542452) | Cod sursa (job #1077355) | Cod sursa (job #1429345) | Cod sursa (job #2186425)
#include<cstdio>
#include<algorithm>
#include<ctime>
#include<stdlib.h>
using namespace std;
FILE * fin = fopen( "sdo.in", "r" );
FILE * fout= fopen( "sdo.out", "w" );
int pos = 0, N, V[(1<<22)], K;
const int Sz = (1<<20);
char buffer[Sz];
inline void citeste( int &numar ){
numar = 0;
while( buffer[pos] < '0' || buffer[pos] > '9' ){
pos++;
if( pos == Sz )
pos = 0, fread( buffer, 1, Sz, fin );
}
while( buffer[pos] >= '0' && buffer[pos] <= '9' ){
numar = numar * 10 + ( buffer[pos] - '0' );
pos++;
if( pos == Sz )
pos = 0, fread( buffer, 1, Sz, fin );
}
return;
}
int poz( int L, int R ){
int ds = 0, dd = -1, aux;
while( L < R ){
if( V[L] > V[R] ){
swap( V[L], V[R] );
aux = ds;
ds = -dd;
dd = -aux;
}
L += ds;
R += dd;
}
return L;
}
void solve( int st, int dr ){
if( st < dr ){
int p = rand() % (dr - st + 1) + st;
swap( V[st], V[p] );
int t = poz( st, dr );
if( K < t )
solve( st, t - 1 );
if( K > t )
solve( t + 1, dr );
}
return;
}
int main(){
fread( buffer, 1, Sz, fin );
citeste( N );
citeste( K );
for( int i = 1; i <= N; i++ )
citeste( V[i] );
srand( time(0) );
solve( 1, N );
fprintf( fout, "%d\n", V[K] );
return 0;
}