Cod sursa(job #2311193)

Utilizator NToniBoSSNicolae Tonitza NToniBoSS Data 2 ianuarie 2019 19:05:33
Problema Statistici de ordine Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.32 kb
#include <bits/stdc++.h>
#define LIM 1<<17
/// TONI BO$$ was here
/// #MLC

using namespace std;
char BUF[LIM];
int poz;

inline char getChar(){
    poz++;
    if(poz>=LIM){
    	fread(BUF,LIM,1,stdin);
    	poz=0;
    }
    return BUF[poz];
}

inline int getNr(){
    int r=0, semn=1;
    char ch=getChar();
    while(isdigit(ch)==0 && ch!='-') ch=getChar();
    if(ch=='-'){
        semn=-1;
        ch=getChar();
    }
    while(isdigit(ch)!=0){
        r=r*10+semn*(ch-'0');
        ch=getChar();
    }
    return r;
}

int v[3000001];

void kth_element(int k,int st,int dr)
{
    if(st>=dr)
        return ;
    int piv,i,j,aux;
    piv=v[st+rand()%(dr-st+1)];
    i=st;
    j=dr;
    while(i<=j)
    {
        while(v[j]>piv && j>=st)
            j--;
        while(v[i]<piv && i<=dr)
            i++;
        if(i<=j)
        {
            aux=v[i];
            v[i]=v[j];
            v[j]=aux;
            i++;
            j--;
        }
    }
    if(j>=k)
        kth_element(k,st,j);
    else
        kth_element(k,i,dr);
}

int main()
{
    int i,n,k;
    freopen("sdo.in","r",stdin);
    freopen("sdo.out","w",stdout);
    n=getNr();
    k=getNr();
    for(i=1; i<=n; i++)
        v[i]=getNr();
    kth_element(k,1,n);
    printf("%d",v[k]);

    return 0;
}