View Code of Problem 49

#include<stdio.h>
int main()
{
	int n, a[10];
	int k, l;
	int i, j;
	int temp;
    while(scanf("%d", &n) != EOF)
	{
	    for(i = 0; i < n; i++)
		{
		    scanf("%d",&a[i]);
		}
        int max = a[0];
        int min = a[0];
	    for(i = 0; i < n; i++)
		{
 		    if(a[i] > max)
			{
			    k = i;
			    max = a[i];
			}
		    if(a[i] < min)
			{
		    	l = i; 
     			min = a[i]; 
			}
		}
	    temp = a[k];
        a[k] = a[n - 1];
    	a[n - 1] = temp;
    	temp = a[l];
	    a[l] = a[0];
    	a[0] = temp;
    	for(i = 0; i < n; i++)
		{
	    	printf("%d ", a[i]);
		}
     	printf("\n");
	}
	return 0;
}