Pagini recente » Istoria paginii utilizator/palaepazona | Autentificare | Monitorul de evaluare | Istoria paginii utilizator/roznek | Cod sursa (job #1036358)
#include<iostream>
#include<fstream>
using namespace std;
int v[3000001];
void qsort(int p,int u,int k)
{
int i=p,j=u,m;
m=v[(i+j)/2];
do
{
while(v[i]<m) i++;
while(v[j]>m) j--;
if(i<=j)
{
swap(v[i],v[j]);
i++;j--;
}
}while(i<j);
if(k>=i) qsort(i,u,k);
if(k<=j) qsort(p,j,k);
}
int main()
{
ifstream f("sdo.in");
ofstream g("sdo.out");
int i,n,k;
f>>n>>k;
for(i=1;i<=n;i++) f>>v[i];
qsort(1,n,k);
for(i=1;i<=n;i++) cout<<v[i]<<" ";cout<<"\n";
cout<<v[k];
f.close();g.close();
return 0;
}