Cod sursa(job #444693)
Utilizator | Data | 21 aprilie 2010 12:00:37 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <stdio.h>
#include <algorithm>
using namespace std;
#define maxN 3000100
int N, K, v[maxN];
char s[maxN];
int main () {
char *p;
int i;
freopen("sdo.in", "r", stdin);
freopen("sdo.out", "w", stdout);
scanf("%d%d\n", &N, &K);
for (i = 1; i <= N; ++ i)
scanf("%u", &v[i]);
nth_element(v + 1, v + K + 1, v + N + 1);
printf("%d\n", v[K]);
}