Pagini recente » Cod sursa (job #2858755) | Cod sursa (job #1293702) | Cod sursa (job #1797352) | Cod sursa (job #332007) | Cod sursa (job #598875)
Cod sursa(job #598875)
#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-1], exit(0);
if (i>k) qs(left,i-1);
if (i<k) qs(i,right);
}
int main()
{
f >> n >> k;
for (i=0; i<n; i++)
f >> a[i];
qs(0,n-1);
return 0;
}