Cod sursa(job #2273247)
Utilizator | Data | 31 octombrie 2018 10:59:33 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("sdo.in");
ofstream out("sdo.out");
int n, k;
int v[3000001];
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;
}