Cod sursa(job #1147579)
Utilizator | Data | 19 martie 2014 22:53:23 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
/*
Keep It Simple!
*/
#ifdef _MSC_VER
#define _CRT_SECURE_NO_WARNINGS
#endif
#include<stdio.h>
#include<algorithm>
#define MaxN 3000001
int N, V[MaxN],K;
int main()
{
freopen("sdo.in", "r", stdin);
freopen("sdo.out", "w", stdout);
scanf("%d%d", &N,&K);
for (int i = 1; i <= N; i++)
scanf("%d", &V[i]);
std::nth_element(V + 1,V + K, V + N + 1);
printf("%d", V[K]);
return 0;
}