Cod sursa(job #1093881)
Utilizator | Data | 28 ianuarie 2014 18:42:01 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
#define NMAX 3000003
int n, k, v[NMAX];
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", &v[i]);
nth_element (v + 1, v + k, v + n + 1);
printf ("%d", v[k]);
return 0;
}