Cod sursa(job #1265828)
Utilizator | Data | 17 noiembrie 2014 20:10:59 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int N, K;
int V[1000005];
int main()
{
fin >> N >> K;
for (int i = 1; i <= N; ++i)
fin >> V[i];
nth_element(V + 1, V + K, V + N + 1);
fout << V[K] << '\n';
fin.close();
fout.close();
return 0;
}