View Code of Problem 49

#include  <stdio.h>
#include  <stdlib.h>
#include  <math.h>
#include  <string.h>

int main()
{
	int i,n,t;
	int a[20];
	int nMin,k,nMax,l;
	scanf("%d",&n);

	for (i=0;i<n;i++)
	{
		scanf("%d",&a[i]);
	}

	nMin = 10000;nMax=-1;
	for (i=0;i<n;i++) 
	{
		if(nMin>a[i])
		{
			nMin = a[i];
			k=i;
		}

		if(nMax<a[i])
		{
			nMax = a[i];
			l = i;
		}
	}
	t = a[0];
	a[0] = a[k];
	a[k]=t;

	t= a[n-1];
	a[n-1] = a[l];
	a[l] = t;

	printf("%d",a[0]);
	for (i=1;i<n;i++)
	{
		printf(" %d",a[i]);
	}printf("\n");
	
	return 0;	
}