Cod sursa(job #1562953)
Utilizator | Data | 5 ianuarie 2016 16:36:44 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in ("sdo.in");
ofstream out ("sdo.out");
int A[3000005], N, K;
void citire()
{
in >> N >> K;
for(int i = 0; i < N; i++)
in >> A[i];
}
int main()
{
citire();
nth_element(A, A+K-1, A+N);
out << A[K-1] << "\n";
}