#include
int main()
{
int a[10],b[10],max,min,n,m,x,y;
for(n=0; n<10; n++)
{
scanf("%d",&a[n]);
}
for(n=0; n<0; n++)
{
b[n]=a[n];
}
max=min=a[0];
for(n=0; n<10; n++)
{
if(max
{
max=a[n];
x=n;
}
if(min>a[n]&&n!=0)
{
min=a[n];
y=n;
}
}
b[0]=min;
b[9]=max;
b[x]=a[9];
b[y]=a[0];
for(n=0; n<10; n++)
{
printf("%d",b[n]);
}
return 0;
}
供参考:
#include <stdio.h>
#define N 11
int main() {
int n, i, t = 0, j = 0,min_i=0,max_i=0;
int arr[N];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &arr[i]);
if(arr[min_i] > arr[i])
min_i = i;
if(arr[max_i] < arr[i])
max_i = i;
}
min_i = arr[min_i]; max_i = arr[max_i];
for (i = 0;i < n; i++) //最小值与第一个数交换
if (arr[i] == min_i){
if (i != 0)
t = arr[i],arr[i] = arr[0],arr[0] = t;
break;
}
for (i = 0;i < n; i++) //最大值与最后一个数交换
if (arr[i] == max_i){
if (i != n - 1)
t = arr[i],arr[i] = arr[n-1],arr[n-1] = t;
break;
}
for (i = 0; i < n; i++)
printf("%d ",arr[i]);
return 0;
}