Cod sursa(job #1465488)
Utilizator | Data | 27 iulie 2015 14:51:49 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ofstream fout("sdo.out");
ifstream fin("sdo.in");
const int NMAX = 3000010;
int v[NMAX], n, k;
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';
return 0;
}