Cod sursa(job #444694)
| Utilizator | Data | 21 aprilie 2010 12:04:47 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <stdio.h>
#include <fstream>
#include <algorithm>
using namespace std;
#define maxN 3000100
int N, K, v[maxN];
int main () {
int i;
ifstream fin("sdo.in");
// freopen("sdo.in", "r", stdin);
freopen("sdo.out", "w", stdout);
fin >> N >> K;
// scanf("%d%d", &N, &K);
for (i = 1; i <= N; ++ i)
fin >> v[i];
// scanf("%d", &v[i]);
nth_element(v + 1, v + K, v + N + 1);
printf("%d\n", v[K]);
}
