View Code of Problem 49

#include <iostream>
using namespace std;

int main(){
  int n,max,min,max_n,min_n;
  while(scanf("%d",&n)!=EOF){
    int num[n];
    max = 0;
    min = 100000;
    max_n = 0;
    min_n = 0;
    for(int j=0;j<n;j++){
      scanf("%d",&num[j]);
      if(num[j]>max){
        max = num[j];
        max_n = j;
      }
      if(num[j]<min){
        min = num[j];
        min_n = j;
      }
    }    
    int t = num[max_n];
    num[max_n] = num[min_n];
    num[min_n] = t;
    
    for(int j=0;j<n;j++){
      if(j==0)
        printf("%d",num[j]);
      else
        printf(" %d",num[j]);
    }
    printf("\n");
  }
  return 0;
}