Cod sursa(job #625989)
Utilizator | IT Zilla ibicec | Data | 25 octombrie 2011 23:44:57 |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <cstdio>
#include <cstdlib>
int cmp(const void *a, const void *b)
{
return *(int*)a - *(int*)b;
}
int main()
{
int n, k, i, j, min, tmp, *a;
freopen("sdo.in", "r", stdin);
freopen("sdo.out", "w", stdout);
scanf("%d%d", &n, &k);
a = (int*) malloc( n*sizeof(int) );
for (i=0; i<n; i++)
scanf("%d", &a[i]);
qsort(a, n, sizeof(int), cmp);
printf( "%d", a[k-1] );
}