Cod sursa(job #2507501)

Utilizator nicoleta_mnMartin nicoleta nicoleta_mn Data 10 decembrie 2019 13:02:45
Problema Statistici de ordine Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.72 kb
#include <fstream>

using namespace std;

ifstream cin("sdo.in");
ofstream cout("sdo.out");

int partitie(int v[],int st,int dr)
{
    swap(v[dr],v[st+rand()%(dr-st+1)]);
    int p=st;
    for(int i=st; i<dr; i++)
    {
        if(v[i]<=v[dr])
        {
            swap(v[i],v[p++]);
        }
    }
    swap(v[p],v[dr]);
    return p;
}

void qs(int v[],int st,int dr,int k)
{
    if(st>=dr)
    {
        return;
    }
    int p=partitie(v,st,dr);
    if(st==k && dr==k)
    {
        qs(v,p+1,p-1,k);
    }
}
int main()
{
    int v[500001],i,n,k;
    cin>>n>>k;
    for(i=0; i<n; i++)
    {
        cin>>v[i];
    }
    qs(v,0,n,k);
    for(i=1; i<=n; i++)
    {
            if(i==k)
            cout<<v[k];

    }
    return 0;

}