Cod sursa(job #2432184)
Utilizator | Data | 22 iunie 2019 14:24:42 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
#include <algorithm>
using namespace std;
#define MAX_N 4000002
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int A[4000001], N, K;
void citire()
{
fin >> N >> K;
for(int i = 1; i <= N; ++i)
fin >> A[i];
}
int main()
{
citire();
nth_element(A+1, A+K, A+N+1);
fout << A[K] << "\n";
}