View Code of Problem 49

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