Pagini recente » Cod sursa (job #1951852) | Cod sursa (job #2547597) | Cod sursa (job #2765668) | Cod sursa (job #720650) | Cod sursa (job #598884)
Cod sursa(job #598884)
#include <fstream>
#include <cstdlib>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int a[3000005],n,k,i;
void qs(int left, int right)
{
int i=left, j=right, r=a[(i+j)/2];
while (i<j)
{
while (a[i]<r) i++;
while (r<a[j]) j--;
if (i<=j) swap(a[i],a[j]), i++, j--;
}
if (i==k) g << a[i], exit(0);
if (i>k) qs(left,i-1);
if (i<k) qs(i+1,right);
}
int main()
{
f >> n >> k;
for (i=1; i<=n; i++)
f >> a[i];
qs(1,n);
return 0;
}