Pagini recente » Cod sursa (job #2123727) | Cod sursa (job #2224471) | Borderou de evaluare (job #528060) | Cod sursa (job #278752) | Cod sursa (job #448674)
Cod sursa(job #448674)
#include<iostream.h>
long long n,v[500001],a,i,m,j;
int main()
{
freopen("sdo.in", "r", stdin);
freopen("sdo.out", "w", stdout);
scanf("%lld" , &n);
scanf("%lld" , &a);
for(i=1;i<=n;i++)
scanf("%lld", &v[i]);
for(i=1;i<=n;i++)
{ for(j=1;j<=n;j++)
{
if(v[i]<v[j]) { m=v[i];
v[i]=v[j];
v[j]=m;
}
}
}
printf("%lld", v[a]);
return 0;
}