Pagini recente » Diferente pentru problema/voodoo intre reviziile 6 si 5 | Cod sursa (job #878703) | Borderou de evaluare (job #411299) | Cod sursa (job #3336928) | Cod sursa (job #1188307)
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
vector <int> v;
int main()
{
int x,n,k;
freopen("sdo.in","r",stdin);
freopen("sdo.out","w",stdout);
scanf("%d%d",&n,&k);
for(int i=1;i<=n;++i){
scanf("%d",&x);
v.push_back(x);
}
nth_element(v.begin(),v.begin()+k-1,v.end());
printf("%d\n",v[k-1]);
return 0;
}