View Code of Problem 49

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,num[20] = { };
	cin>>n;
	for(int i = 0;i<n;i++)cin>>num[i];
	int max = num[0],min = num[0],posm = 0,posx = 0;
	for(int i = 1;i<n;i++){
		if(max < num[i]){
			max = num[i];
			posx = i;
		}
		if(min > num[i]){
			min = num[i];
			posm = i;
		}
	}
	
	int t;
	t = num[0];
	num[0] = min;
	num[posm] = t;
	
	t = num[n-1];
	num[n-1] = max;
	num[posx] = t;
	for(int i = 0;i<n;i++){
		if(i == n-1)cout<<num[i];
		else cout<<num[i]<<" ";
	}
	return 0;
}

Double click to view unformatted code.


Back to problem 49