Pagini recente » Cod sursa (job #26960) | Cod sursa (job #371174) | Cod sursa (job #19404) | Cod sursa (job #1742631) | Cod sursa (job #382696)
Cod sursa(job #382696)
#include <algorithm>
using namespace std;
#define DIM 3000001
#define MAX 10001
char s[ MAX ];
int n, k, cnt, a[ DIM ];
inline void read( int &x ) {
while( !isdigit( s[ cnt ] ) )
if( ++cnt == MAX ) {
fread( s, 1, MAX, stdin );
cnt = 0;
}
for( x = 0; isdigit( s[ cnt ] ); ) {
x = x*10 + s[ cnt ] - '0';
if( ++cnt == MAX ) {
fread( s, 1, MAX, stdin );
cnt = 0;
}
}
}
int main() {
freopen( "sdo.in", "r", stdin );
freopen( "sdo.out", "w", stdout );
int i;
read( n );
read( k );
for( i = 1; i <= n; ++i )
read( a[ i ] );
nth_element( a+1, a+k, a+n+1 );
printf( "%d", a[ k ] );
return 0;
}