Cod sursa(job #1714674)

Utilizator cubaLuceafarul cuba Data 9 iunie 2016 00:26:57
Problema Statistici de ordine Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.82 kb
#include <fstream>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
const int NMAX=3000003;
int n,k,a[NMAX];
inline int Partition(int left,int right)
{
    int j=left;
    swap(a[(left+right)/2],a[right]);
    for(int i=left;i<=right;i++)
        if(a[i]<a[right])
        {
            swap(a[i],a[j]);
            j++;
        }
    swap(a[j],a[right]);
    return j;
}
inline void Quick(int st,int dr)
{
    if(st<=dr)
    {
        int poz=Partition(st,dr);
        if(poz==k)
        {
            g<<a[poz]<<" ";
            return;
        }
        else
            if(poz<k)
                Quick(poz+1,dr);
            else
                Quick(st,poz-1);
    }
}
int main()
{
    f>>n>>k;
    for(int i=1;i<=n;i++)
        f>>a[i];
    Quick(1,n);
    return 0;
}