Cod sursa(job #381003)
Utilizator | Florin Ghesu floringh06 | Data | 8 ianuarie 2010 15:43:02 |
---|---|---|---|
Problema | Statistici de ordine | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
#define FIN "sdo.in"
#define FOUT "sdo.out"
#define MAX_N 3000005
int N, K, A[MAX_N];
int main()
{
freopen (FIN, "r", stdin);
freopen (FOUT, "w", stdout);
scanf ("%d %d", &N, &K);
for(int i = 1; i <= N; ++i)
scanf ("%d", A + i);
nth_element(A + 1, A + K, A + N + 1);
printf ("%d\n", A[K]);
return 0;
}