Pagini recente » Cod sursa (job #2924191) | Cod sursa (job #2821882) | Diferente pentru problema/alee2 intre reviziile 1 si 11 | Cod sursa (job #2749976) | Cod sursa (job #1469029)
#include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int n,k,nr;
vector<int> v;
int main()
{
freopen("sdo.in","r",stdin);
freopen("sdo.out","w",stdout);
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++)
{
scanf("%d",&nr);
v.push_back(nr);
}
nth_element(v.begin(),v.begin()+k,v.begin()+n+1);
printf("%d",v[k]);
return 0;
}