Cod sursa(job #2391838)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 29 martie 2019 12:01:00
Problema Statistici de ordine Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.73 kb
#include<cstdio>
#include<ctime>
const int M=3000001,N=20000000;
int a[M],n,k,i,o;
char r[N];
inline int A()
{
  	int s=0;
  	for(;r[o]<'0'||r[o]>'9';o++);
  	for(;r[o]>='0'&&r[o]<='9';o++)
  		s=s*10+r[o]-'0';
  	return s;
}
inline int P(int a[],int b,int c)
{
	int i=b-1,j=c+1,p=a[b+(rand()%(c-b+1))];
	while(1)
	{
		for(i++;a[i]<p;i++);
		for(j--;a[j]>p;j--);
		if(i<j)
			swap(a[i],a[j]);
		else
			return j;
	}
	return 0;
}
inline void S(int a[],int i,int j,int k)
{
	if(i==j)
		return;
	int q=P(a,i,j),t=q-i+1;
	t>=k?S(a,i,q,k):S(a,q+1,j,k-t);
}
int main()
{
    freopen("sdo.in","r",stdin),freopen("sdo.out","w",stdout),fread(r,1,N,stdin);
	for(srand(time(NULL)),n=A(),k=A(),i=1;i<=n;i++)
		f>>a[i];
	S(a,1,n,k),printf("%d",a[k]);
}