Cod sursa(job #1081188)
| Utilizator | Data | 13 ianuarie 2014 12:31:49 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
/*
Keep It Simple!
*/
#include<stdio.h>
#include<algorithm>
using namespace std;
long long N,K,A[3000005];
int main()
{
freopen("sdo.in","r",stdin);
freopen("sdo.out","w",stdout);
scanf("%lld %lld",&N,&K);
for(int i=1; i<=N; i++)
scanf("%lld",&A[i]);
nth_element(A+1,A+2,A+N+1);
printf("%lld",A[K]);
return 0;
}
