Cod sursa(job #982462)
Utilizator | Data | 9 august 2013 11:55:36 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 20 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <stdio.h>
#define MAXSIZE 30000001
long M[MAXSIZE];
int main()
{
int n, k;
int i, j, less;
freopen("sdo.in", "r", stdin);
freopen("sdo.out", "w", stdout);
scanf("%d %d", &n, &k);
for (i = 1; i <= n; ++i)
scanf("%ld", M + i);
for (i = 1; i <= n; ++i)
{
less = 0;
for (j = 1; j <= n; ++j)
if (M[j] < M[i])
++less;
if (less == (k - 1))
{
printf("%ld\n", M[i]);
return 0;
}
}
return 0;
}