Pagini recente » Cod sursa (job #265899) | Cod sursa (job #2202010) | Cod sursa (job #529686) | Cod sursa (job #1619287) | Cod sursa (job #1046195)
#include <iostream>
#include<fstream>
using namespace std;
int v[3000001];
void quicksort(int left,int right,int k)
{int i=left,j=right,p=v[(i+j)/2];
while(i<=j)
{
while(v[i]<p)
i++;
while(v[j]>p)
j--;
if(i<=j)
{
swap(v[i],v[j]);
i++;j--;
}
}
if(k>=i)
quicksort(i,right,k);
if(k<=j)
quicksort(left,j,k);
}
int main()
{int k,n=0;
ifstream f("sdo.in");
ofstream f2("sdo.out");
f>>n;
f>>k;
for(int i=0;i<n;i++)
f>>v[i];
quicksort(0,n-1,k-1);
f2<<v[k-1];
return 0;
}