Cod sursa(job #374314)
Utilizator | Data | 16 decembrie 2009 18:02:06 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
#define Nmax 3000005
int i, n, k, x;
int V[Nmax];
int main () {
FILE *f = fopen ("sdo.in", "r");
FILE *g = fopen ("sdo.out", "w");
fscanf (f, "%d %d", &n, &k);
for (i = 0; i < n; i++)
fscanf (f, "%d", &V[i]);
nth_element (V, V + k - 1, V + n);
fprintf (g, "%d", V[k-1]);
fclose (f);
fclose (g);
return 0;
}