Cod sursa(job #577836)
Utilizator | Teodora Tanase TeodoraTanase | Data | 10 aprilie 2011 17:48:20 |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
#include <algorithm>
using namespace std;
const int M=3000003;
int n, k, a[M];
int main()
{
ifstream fin ("sdo.in");
ofstream fout ("sdo.out");
fin >> n >> k;
for (int i=0; i<n; ++i)
fin >> a[i];
nth_element(a,a+k,a+n);
fout << a[k-1] << '\n';
return 0;
}