Cod sursa(job #680392)
Utilizator | Data | 15 februarie 2012 15:34:06 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
int n, k, v[3000005];
int main()
{
int i;
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]);
nth_element(v + 1, v + k, v + n + 1);
printf("%d", v[k]);
return 0;
}