Pagini recente » Cod sursa (job #1309625) | Cod sursa (job #1197592) | Cod sursa (job #1529621) | Cod sursa (job #2639540) | Cod sursa (job #436675)
Cod sursa(job #436675)
#include <fstream>
#define DIM 3000005
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int a[DIM], k, n;
void Sort(int stanga, int dreapta);
int main()
{
int ls, dr;
fin >> n >> k;
for ( int i = 1; i <= n; i++)
fin >> a[i];
ls = 0; dr = n;
Sort(ls,dr);
fout<<a[k];
fout.close();
fin.close();
return 0;
}
void Sort(int stanga, int dreapta )
{
int i = stanga, j = dreapta;
int aux;
int mij = a[(stanga+dreapta)/2];
while ( i <= j )
{
while ( a[i] < mij )
i++;
while ( a[j] > mij )
j--;
if ( i <= j )
{
aux=a[i];
a[i]=a[j];
a[j]=aux;
i++;
j--;
}
}
if ( stanga < j )
Sort(stanga,j);
if ( i < dreapta )
Sort(i,dreapta);
}