View Code of Problem 49

#include<stdio.h>
int main()
{
	int a[11] ,i ,j,n ,max ,min ,t ,h,c,d;
	scanf("%d", &n);
	for (i = 0; i < n; i++)
		scanf("%d",&a[i]);
	max = a[n - 1];
	min = a[0];
	for (i = 0; i < n; i++)
	{
		if (a[i] < min)
			min = a[i];
	}
	for (j = 0; j < n; j++)
	{
		if (a[j] > max)
			max = a[j];
	}
	for (i = 0; i < n; i++)
	{
		c = max - a[i];
		while (c == 0)
		{
			h = a[n - 1];
			a[n - 1] = a[i];
			a[i] = h;
			break;
		}
	}
	for (j = 0; j < n; j++)
	{
		d = min - a[j];
		while (d ==0)
		{
			t = a[0];
			a[0] = a[j];
			a[j] = t;
			break;
		}
	}
	for (i = 0; i < n;i++)
	if (i<(n-1))
		printf("%d ", a[i]);
	else
    printf("%d", a[i]);
	return 0;
}