Pagini recente » Cod sursa (job #2809244) | Cod sursa (job #2746017) | Borderou de evaluare (job #2943669) | Cod sursa (job #1560823) | Cod sursa (job #2507502)
#include <fstream>
using namespace std;
ifstream in("sdo.in");
ofstream out("sdo.out");
int v[3000001];
int partitie(int v[], int st, int dr)
{
int p=st;
for(int i=st; i<dr; i++)
{
if(v[i]<=v[dr])
{
swap(v[i], v[p++]);
}
}
swap(v[p], v[dr]);
return p;
}
void qs(int v[], int st, int dr, int k)
{
if(st>=dr)
{
return;
}
int p=partitie(v, st, dr);
if(k<=p)
qs(v, st, p-1, k);
else
qs(v, p+1, dr, k);
}
int main()
{
int n, k;
in>>n>>k;
int st=0;
int dr=n-1;
for(int i=0; i<n; i++)
{
in>>v[i];
}
qs(v, st, dr, k);
out<<v[k-1];
return 0;
}