in c++

time limit per test: 1 second memory limit per test: 256 megabytes input: standard input output: standard output Given a number N and an array A of N numbers. Print the array after doing the following operations: - Find minimum number in these numbers. - Find maximum number in these numbers. - Swap minimum number with maximum number. Input First line contains a number N(2N1000) number of elements. Second line contains N numbers (105Ai105 ) It's guaranteed that all numbers are distinct. Output Languages Print the array after the replacement operation. The following languages are only available languages for the problems from the contest E-learning before spring - sheet \#1t - Ciang ++20 Diagnostics - Ciangt+17 Diagnostics - GNU G++146.4.0 - GNU G++177.3.0 - GNU G++2011.2.0 (64 bit, winlibs) - Microsoft visual C++2017 - GNu G++17 9.2.0 (64 bit, msys 2) Virtual participation virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for. virtual contests. If you ye seen these