View Code of Problem 49

#include<iostream>
using namespace std;
 
int main(){
	int n;
	cin>>n;
	int a[n];
	for(int i = 0; i < n; i++){
		cin>>a[i];
	}
	int min = a[0];
	int minsub  = 0;
	for(int i = 0; i < n; i++){        //找到最大，最小值 
		if(a[i] < min) {
			min = a[i];
			minsub = i;
		}
	}
	swap(a[minsub],a[0]);
	
	int max = a[0];
	int maxsub  = 0;	
	for(int i = 0; i < n; i++){        //找到最大，最小值 
		if(a[i] > max) {
			max = a[i];
			maxsub = i;
		}
	}
	swap(a[maxsub],a[n-1]);
	
    for(int i=0;i<n;i++){
		if(i!=n-1){
			cout<<a[i]<<" ";
		}
		else{ 
			cout<<a[i]<<endl;
		}
	}
}