Cod sursa(job #1161960)
Utilizator | Data | 31 martie 2014 15:53:11 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <cstdio>
#include <algorithm>
#define Nmax 3000005
using namespace std;
int v[Nmax];
int main()
{
int N,K,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\n", v[K]);
return 0;
}