Cod sursa(job #1896483)
Utilizator | Data | 28 februarie 2017 18:36:07 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
#include <algorithm>
using namespace std;
#define MAXN 3000005
ifstream fin ("sdo.in");
ofstream fout ("sdo.out");
int A[MAXN], 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";
}