Cod sursa(job #982528)
| Utilizator | Data | 9 august 2013 14:00:53 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 20 |
| Compilator | c | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <stdio.h>
#define MAXSIZE 30000001
long M[MAXSIZE];
int main()
{
int n, k;
int i, j, temp;
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 <= k; ++i)
{
int min = i;
for (j = i + 1; j <= n; ++j)
if (M[j] < M[min])
min = j;
if (min != i)
{
temp = M[i];
M[i] = M[min];
M[min] = temp;
}
}
printf("%ld\n", M[k]);
return 0;
}
