Pagini recente » Cod sursa (job #2910834) | Cod sursa (job #1148691) | Cod sursa (job #78998) | Cod sursa (job #816787) | Cod sursa (job #3199493)
#include <fstream>
#include <ctime>
using namespace std;
ifstream fin ("sdo.in");
ofstream fout ("sdo.out");
unsigned int v[4000001];
int n,i,k;
unsigned int pivot (int st,int dr)
{
///i+1,j+0
///i+0,j-1
int poz=rand ()%(dr-st+1)+st;
swap (v[st],v[poz]);
int ok=0;
while (st<dr)
{
if (v[st]>v[dr])
{
swap (v[st],v[dr]);
ok=1-ok;
}
st+=ok;
dr-=(1-ok);
}
return st;
}
int quick_sort (int st,int dr)
{
if (st==dr)
return v[st];
else
{
int poz=pivot (st,dr);
if (poz>=k)
return quick_sort (st,poz);
else
return quick_sort (poz+1,dr);
}
}
int main()
{
srand (time (NULL));
fin>>n>>k;
for (i=1; i<=n; i++)
fin>>v[i];
fout<<quick_sort (1,n);
return 0;
}