Pagini recente » Borderou de evaluare (job #1213062) | Borderou de evaluare (job #2502160) | Borderou de evaluare (job #2939990) | Borderou de evaluare (job #2915114) | Cod sursa (job #433262)
Cod sursa(job #433262)
#include <cstdio>
#include <algorithm>
using namespace std;
#define NMAX 3000004
int A[NMAX], n, k;
int main()
{
freopen("sdo.in","r",stdin);
freopen("sdo.out","w",stdout);
scanf("%d %d",&n,&k);
int i;
for(i = 1; i <= n; ++i) scanf("%d",&A[i]);
nth_element(A+1, A+k, A+n+1);
printf ("%d\n",A[k]);
return 0;
}