Cod sursa(job #1973559)
Utilizator | Data | 25 aprilie 2017 13:33:14 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("sdo.in");
ofstream out("sdo.out");
int n, k;
int v[3000010];
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;
}