Pagini recente » Monitorul de evaluare | Rating Coman Tudor (tudorelica) | Cod sursa (job #1544348) | Cod sursa (job #288580) | Cod sursa (job #1010237)
#include<iostream>
#include<fstream>
#include<ctime>
#include<cstdlib>
using namespace std;
int n, v[3000000];
ofstream g("sdo.out");
int pivot(int left, int right)
{
int p1,p2,p3,p,mini,maxi;
p1=v[left + rand() % (right-left+1)];
p2=v[left + rand() % (right-left+1)];
p3=v[left + rand() % (right-left+1)];
srand(time(NULL));
if(p1<=p2&&p1<=p3)
mini=p1;
if(p2<=p1&&p2<=p3)
mini=p2;
if(p3<=p1&&p3<=p2)
mini=p3;
if(p1>=p2&&p1>=p3)
maxi=p1;
if(p2>=p1&&p2>=p3)
maxi=p2;
if(p3>=p1&&p3>=p2)
maxi=p3;
p=p1+p2+p3-maxi-mini;
return p;
}
void sdo(int poz, int left, int right)
{
int p=v[(left+right)/2], ok, tmp, i=left, j=right;
if(left<right)
{
while(i<=j)
{
while(v[i]<p)
i++;
while(v[j]>p)
j--;
if(i<=j)
{
tmp=v[i];
v[i]=v[j];
v[j]=tmp;
i++;
j--;
}
}
j++;
if(poz<j)
sdo(poz,left,j-1);
else
sdo(poz-j+1,j,right);
}
}
int main()
{
int k;
ifstream f("sdo.in");
f>>n>>k;
for(int i=0;i<=n-1;i++)
f>>v[i];
caut(k,0,n-1);
g<<v[k-1];
}