Cod sursa(job #415589)
Utilizator | Data | 11 martie 2010 16:10:45 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
#include <algorithm>
using namespace std;
#define MAX_N 3000005
ifstream fin ("sdo.in");
ofstream fout ("sdo.out");
int A[MAX_N], N, K;
int main()
{
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";
}