Cod sursa(job #1081185)
Utilizator | Data | 13 ianuarie 2014 12:30:22 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
/*
Keep It Simple!
*/
#include<stdio.h>
#include<algorithm>
using namespace std;
int N,K,A[3000005];
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",&A[i]);
nth_element(A+1,A+1,A+N+1);
printf("%d",A[K]);
return 0;
}