Pagini recente » Cod sursa (job #2329777) | Cod sursa (job #786363) | Cod sursa (job #2656105) | Borderou de evaluare (job #1544503) | Cod sursa (job #610773)
Cod sursa(job #610773)
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char buff[100005],*q;
int n,i,k,L,a[3000005];
int main()
{
freopen("sdo.in","rb",stdin);freopen("sdo.out","w",stdout);
scanf("%d%d",&n,&k);
for(i=1;i<=n;)
{
L=fread(buff,1,100000,stdin);
if(L==100000)
{
q=buff+L-1;buff[L]=0;
for(;*q!=' ';)
{
*q=0;fseek(stdin,-1,SEEK_CUR);q--;
}
}
q=strtok(buff," \n\r");
for(;q;)
{
a[i++]=atoi(q);q=strtok(NULL," \n\r");
}
}
nth_element(a+1,a+k,a+n+1);printf("%d\n",a[k]);
return 0;
}