Pagini recente » Borderou de evaluare (job #795614) | Borderou de evaluare (job #3302610) | Borderou de evaluare (job #1047110) | Borderou de evaluare (job #923170) | Cod sursa (job #1879421)
#include <stdio.h>
#include <algorithm>
#include <stdlib.h>
using namespace std;
int n,k,a[3000005];
char *b;
void citire()
{
int l,i,j;
fseek(stdin,0,SEEK_END);
l=ftell(stdin);
rewind(stdin);
b=(char*)malloc(l*sizeof(char));
fread(b,sizeof(char),l,stdin);
for (j=0;isdigit(b[j]);j++) n=n*10+b[j]-'0';
for (++j;isdigit(b[j]);j++) k=k*10+b[j]-'0';
for (i=1;i<=n;i++)
for (++j;isdigit(b[j]);j++) a[i]=a[i]*10+b[j]-'0';
}
int main()
{
freopen("sdo.in","r",stdin);
freopen ("sdo.out","w",stdout);
citire();
nth_element(a+1,a+k,a+n+1);
printf("%i",a[k]);
fclose(stdin);
fclose(stdout);
return 0;
}