View Code of Problem 49

#include<cstdio>
#include<iostream>
using namespace std;
int a[20];
int main()
{
    int n;
    cin>>n;
    for(int i=0;i<n;i++)
        cin>>a[i];
    int maxNum=0,maxIndex=-1;
    int minNum=99999999,minIndex=-1;
    for(int i=0;i<n;i++)
    {
        if(maxNum<a[i])
        {
            maxNum=a[i];
            maxIndex=i;
        }
        if(minNum>a[i])
        {
            minNum=a[i];
            minIndex=i;
        }
    }
    swap(a[0],a[minIndex]);
    swap(a[n-1],a[maxIndex]);
    for(int i=0;i<n-1;i++)
        cout<<a[i]<<" ";
    cout<<a[n-1]<<endl;
    return 0;
}