Cod sursa(job #380864)
Utilizator | Data | 7 ianuarie 2010 23:06:39 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<stdio.h>
#include<stdlib.h>
struct asd{int x;};
asd v[3000000];
int i,n,k,x;
int cmp(const void *a, const void *b)
{
return ((asd *)a)->x-((asd *)b)->x;
}
int main()
{
freopen("sdo.in", "r", stdin);
freopen("sdo.out", "w", stdout);
scanf("%d %d", &n, &k);
for(i=1;i<=n;i++)
scanf("%d", &v[i].x);
v[0].x=-1000000001;
qsort(v, n+1, sizeof(asd), cmp);
printf("%d\n", v[k]);
return 0;
}