考研机试真题-特殊排序-华中科技大学

题目链接：
https://www.nowcoder.com/practice/57f0f528bff149be9580af66f6292430?tpId=40&tqId=21543&tPage=1&rp=1&ru=/ta/kaoyan&qru=/ta/kaoyan/question-ranking

代码：

#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 10010;

int main(){
    int n;
    int a[maxn];
    int max_val = -1, max_loc = -1;
    while (scanf("%d", &n) != EOF) {
        for(int i = 0; i < n; ++i){
            scanf("%d", &a[i]);
            if(max_val < a[i]){
                max_val = a[i];
                max_loc = i;
            }
        }
        printf("%d\n",max_val);
        if(n == 1){
            printf("-1\n");
        }
        else{
            a[max_loc] = a[n - 1];
            sort(a, a + n - 1);
            for(int i = 0; i < n - 1; ++i){
                printf("%d ", a[i]);
            }
            printf("\n");

        }

    }

    return 0;
}