Cod sursa(job #2152361)
| Utilizator | Data | 5 martie 2018 14:29:13 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#include <iomanip>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
const int NLIM = 3e6+10;
int n, k;
int x[NLIM];
int main()
{
ios::sync_with_stdio(false);
fin >> n >> k;
for(int i = 0; i < n; ++i)
fin >> x[i];
nth_element(x, x + k-1, x + n);
/**
for(int i = 0; i < n; ++i)
cout << x[i] << " ";
cout << "\n";
/**/
fout << x[k-1] << "\n";
return 0;
}
