Cod sursa(job #433262)
Utilizator | Data | 3 aprilie 2010 15:13:47 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#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;
}