Pagini recente » Cod sursa (job #1326417) | Cod sursa (job #1073039) | Cod sursa (job #2418888) | Cod sursa (job #2364368) | Cod sursa (job #3199521)
#include <fstream>
#include <algorithm>
#include <ctime>
#include <cstdlib>
using namespace std;
ifstream cin("sdo.in");
ofstream cout("sdo.out");
int v[3000005],n,k;
int quickselect(int st,int dr)
{
if(st==dr)
return v[st];
else if(st<dr)
{
int p=st+rand()%(dr-st+1);
int i=st;
int j=dr;
int mod=0;
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);
}
///elementul pivot a fost plasat pe pozitia i
if(k<=i)
quickselect(st,i);
else
quickselect(i+1,dr);
}
}
int main()
{
srand(time(NULL));
cin>>n>>k;
for(int i=1; i<=n; i++)
cin>>v[i];
cout<<quickselect(1,n);
return 0;
}