Cod sursa(job #711182)
Utilizator | Stratulat Alexandru Fayed | Data | 11 martie 2012 15:58:41 |
---|---|---|---|
Problema | Statistici de ordine | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<cstdio>
#include<stdlib.h>
using namespace std;
int n,k,V[3000000];
int compare(const void *a,const void *b)
{
return(*(int*)a-*(int*)b);
}
int main()
{
freopen("sdo.in","r",stdin);
freopen("sdo.out","w",stdout);
scanf("%d%d",&n,&k);
for(int i=0;i<n;i++)
scanf("%d",&V[i]);
qsort(V,n,sizeof(int),compare);
printf("%d",V[k-1]);
return 0;
}