观察给出的式子特点,可以发现只需要找到最小值和最大值即可
然后把剩余的数据从小到达输出即可
代码如下:
#include <cstdio>
#include <iostream>
#include <algorithm>
#define MAXN 10010
#define ll long long
using namespace std;
int a[MAXN];
int main(void) {
int n;
int mina = 10000;
int maxa = -10000;
while(cin >> n) {
for(int i=0; i<n; ++i) {
cin >> a[i];
mina = min(mina, a[i]);
maxa = max(maxa, a[i]);
}
sort(a, a+n);
cout << a[n-1];
for(int i=1; i<n-1; ++i) {
printf(" %d", a[i]);
}
printf(" %d\n", a[0]);
}
}