Cod sursa(job #629197)
Utilizator | FMI Ciprian Olariu scipianus | Data | 2 noiembrie 2011 20:43:21 |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp | Status | done |
Runda | gc_practice | Marime | 0.35 kb |
#include<fstream>
#include<algorithm>
using namespace std;
int n,k,a[3000005];
inline void Citire()
{
int i;
ifstream fin("sdo.in");
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>a[i];
fin.close();
}
inline void Afisare()
{
ofstream fout("sdo.out");
fout<<a[k]<<"\n";
fout.close();
}
int main()
{
Citire();
nth_element(a+1,a+k,a+n+1);
Afisare();
return 0;
}