主要思想是:现将五个人的身高用冒泡排序法进行排序,将相邻的2个身高做差,选择差值交小的那一组
# include < stdio.h >
# define n 5int main ()
{
int i ,a[n];
int j , tmp;
int tmp1, num1 , num2 , min;
for ( i = 0; i < n; i++ )
scanf ( " %d" , &a[ i ] );
for ( i = 0; i < n-1 ; i++ )
for ( j = 0 ; j< n-1 - i ; j++)
{
if ( a[ j ] > a[ j+1 ] )
{
tmp = a[ j ];
a[ j ] = a[ j + 1 ];
a[ j + 1 ] = tmp;
}
}
//for ( i =0 ; i < n; i ++ )
// printf ( "%d " , a[i]);
// printf ("\n");
min = a[1] - a[0];
num1 = a[ 1 ];
num2 = a[ 0 ];
for ( i = 1; i < n - 1; i++)
{
tmp1 = a[ i+1 ] - a[ i ];
if ( min > tmp1 )
{
min = tmp1;
num1 = a[ i+1 ];
num2 = a[ i ];
}
if ( min == tmp1 )
{
num1 = a[ i+1 ];
num2 = a[ i];
}
}
//printf ( "%d\n" , min);
printf ( "%d %d\n" , num1 , num2 );
return 0;
}