Cod sursa(job #1670795)
Utilizator | Data | 1 aprilie 2016 00:35:54 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("sdo.in");
ofstream out("sdo.out");
const int dmax = 3000001;
int v[dmax];
int N, K;
int main()
{
in >> N >> K;
for(int i = 1; i <= N; i++) in >> v[i];
nth_element(v + 1, v + K, v + N + 1);
out << v[K];
return 0;
}