Pagini recente » Cod sursa (job #2776359) | Cod sursa (job #392630) | Cod sursa (job #1104279) | Cod sursa (job #804830) | Cod sursa (job #1184808)
#include <iostream>
#include <fstream>
#include <cstdlib>
using namespace std;
ifstream in("sdo.in");
ofstream out("sdo.out");
int v[3000001],poz;
inline void schimb(int &a,int &b)
{
int aux;
aux=a;
a=b;
b=aux;
}
int partitie(int st,int dr)
{
int i,j;
i = st + rand()%(dr - st + 1);
schimb(v[i], v[dr]);
j=st;
for(i=st;i<dr;i++)
{
if(v[i]<v[dr])
schimb(v[j++],v[i]);
}
schimb(v[j],v[dr]);
return j;
}
void qsort(int st,int dr)
{
if(st>=dr)
return;
int p=partitie(st,dr);
if(poz<p)
qsort(st,p-1);
if(poz>p)
qsort(p+1,dr);
}
int main()
{
int n,i;
in>>n>>poz;
for(i=1;i<=n;i++)
{
in>>v[i];
}
qsort(1,n);
/* for(i=1;i<=n;i++)
{
out<<v[i]<<" ";
}*/
out<<v[poz];
return 0;
}