Cod sursa(job #718670)
Utilizator | Smeu Rares Sm3U | Data | 20 martie 2012 23:02:44 |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <cstdio>
#include <algorithm>
#define nMax 3000000
using namespace std;
int a[nMax];
int n;
int k;
int main()
{
freopen ("sdo.in", "r", stdin);
freopen ("sdo.out", "w", stdout);
scanf ("%d %d", &n, &k);
for (int i = 0; i < n; ++ i){
scanf ("%d", &a[i]);
}
nth_element (a, a + k - 1, a + n);
printf ("%d\n", a[k - 1]);
return 0;
}