题解 | #排序#

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100;
int arr[MAXN];

int main() {
    int n = 0;
    while (scanf("%d", &n) != EOF) {
        for (int i = 0; i < n; ++i) {
            scanf("%d", &arr[i]);
        }
        sort(arr, arr + n);
        for (int j = 0; j < n; j++) {
            printf("%d ", arr[j]);//注意空格
        }
        printf("\n");
    }
    return 0;
}