Cod sursa(job #1220470)
Utilizator | Data | 17 august 2014 14:27:55 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <algorithm>
using namespace std;
const int MAX_N = 3000005;
ifstream fin ("sdo.in");
ofstream fout ("sdo.out");
int A[MAX_N], N, K;
void read()
{
fin >> N >> K;
for(int i = 1; i <= N; ++i)
fin >> A[i];
nth_element(A+1, A+K, A+N+1);
fout << A[K] << "\n";
}
int main()
{
read();
return 0;
}