Pagini recente » Monitorul de evaluare | Cod sursa (job #3254579) | Monitorul de evaluare | Cod sursa (job #408538) | Cod sursa (job #3196052)
#include <fstream>
#include <time.h>
using namespace std;
unsigned int v[3000002],n, k;
ifstream cin("sdo.in");
ofstream cout("sdo.out");
unsigned int quicksort(int st, int dr)
{
if(st == dr)
return v[st];
if(st<dr)
{
int i=st, j=dr, mod=0;
int p=rand()%(dr-st+1)+st;
swap(v[st],v[p]);
while(i<j)
{
if(v[i] > v[j])
{
swap(v[i],v[j]);
mod=1-mod;
}
i=i+mod;
j=j-(1-mod);
}
if(i==k) return v[i];
if(i>k)
return quicksort(st,i-1);
if(i<k)
return quicksort(i+1,dr);
}
}
int main()
{
cin>>n>>k;
for(int i=1;i<=n;i++)
cin>>v[i];
srand (time(NULL));
cout<<quicksort(1,n);
return 0;
}