Pagini recente » Cod sursa (job #1364482) | Cod sursa (job #2285939) | Cod sursa (job #104529) | Cod sursa (job #1543800) | Cod sursa (job #1014842)
#include<iostream>
#include<fstream>
using namespace std;
void quick(long long v[1000],long long st,long long dr)
{long long i=st,j=dr,c;
long long pivot=v[(i+j)/2];
while(i<=j)
{while(v[i]<pivot)
i++;
while(v[j]>pivot)
j--;
if(i<=j)
{c=v[i];
v[i]=v[j];
v[j]=c;
i++;
j--;}
}
if(st<j)
quick(v,st,j);
if(i<dr)
quick(v,i,dr);}
int main()
{ifstream f("sdo.in");
ofstream g("sdo.out");
long long k,n,i,v[1000];
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
quick(v,1,n);
g<<v[k];
f.close();
g.close();
return 0;}