Cod sursa(job #633636)
Utilizator | Socaciu-Cumpanasu Bogdan SCBbestof | Data | 14 noiembrie 2011 12:11:59 |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<stdio.h>
#include<stdlib.h>
int i,k,N,v[3000001];
int cmp (const void*x , const void*y)
{
return *(int*)x - *(int*)y;
}
int main()
{
freopen("sdo.in","r",stdin);
freopen("sdo.out","w",stdout);
scanf("%d%d",&N,&k);
for(i = 0 ; i < N ; ++i )
scanf("%d",&v[i]);
qsort( v , N , sizeof ( v[0] ), cmp);
printf("%d",v[k-1]);
return 0;
}