Cod sursa(job #371142)
Utilizator | Andrei Misarca Mishu91 | Data | 3 decembrie 2009 22:20:36 |
---|---|---|---|
Problema | Statistici de ordine | Scor | Ascuns |
Compilator | cpp | Status | done |
Runda | Marime | 0.42 kb |
#include <fstream>
#include <algorithm>
#include <cassert>
using namespace std;
#define MAX_N 3000005
ifstream fin ("sdo.in");
ofstream fout ("sdo.out");
int A[MAX_N], N, K;
void citire()
{
fin >> N >> K;
assert(1 <= N <= 3000000);
assert(1 <= K <= N);
for(int i = 1; i <= N; ++i)
{
fin >> A[i];
assert(1 <= A[i] <= 1000000000);
}
}
int main()
{
citire();
nth_element(A+1, A+K, A+N+1);
fout << A[K] << "\n";
}