Cod sursa(job #629208)
Utilizator | FMI Ciprian Olariu scipianus | Data | 2 noiembrie 2011 20:57:45 |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp | Status | done |
Runda | gc_practice | Marime | 0.39 kb |
#include<cstdio>
#include<fstream>
#include<algorithm>
using namespace std;
int n,k,a[3000005];
inline void Citire()
{
register int i;
freopen("sdo.in","r",stdin);
scanf("%d %d",&n,&k);
for(i=1;i<=n;i++)
scanf("%d",a+i);
}
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;
}