RT
求查错
#include<iostream>
#include<algorithm>
using namespace std;
int n,a[1010],s,e,minn,maxx;
int main(){
cin >> n;
for(int i=1;i<=n;i++){
cin >> a[i];
}
s=1;
e=n;
for(int i=1;i<=n/2+1;i++){
minn=s;
maxx=s;
for(int j=s;j<=e;j++){
if(a[j]<a[minn]){
minn=j;
}
if(a[j]>a[maxx]){
maxx=j;
}
}
swap(a[s],a[minn]);
swap(a[e],a[maxx]);
s++;
e--;
}
for(int i=1;i<=n;i++){
cout << a[i] << " ";
}
return 0;
}