题解（全）

#include <bits/stdc++.h> 
using namespace std;

int main(){
    int n,a[1005];
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    sort(a,a+n);
    for(int i=0;i<n;i++){
        cout<<a[i]<<" ";
    }
    return 0;
}

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> a(n);

   for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }

    sort(a.begin(), a.end());

    for (size_t i = 0; i < a.size(); ++i) {
       cout << a[i];
        if (i < a.size() - 1) cout << " ";
   }
    cout << endl;

    return 0;
}

#include <iostream>
#include <vector>
using namespace std;

void quickSort(vector<int>& arr, int low, int high) {
   if (low < high) {
        int pivot = arr[high];
        int i = low - 1;
        for (int j = low; j < high; ++j) {
            if (arr[j] <= pivot) {
                ++i;
                swap(arr[i], arr[j]);
            }
        }
        swap(arr[i + 1], arr[high]);
       int pi = i + 1;

        quickSort(arr, low, pi - 1);
        quickSort(arr, pi + 1, high);
   }
}

int main() {
    int n;
    cin >> n;
    vector<int> a(n);

    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }

    quickSort(a, 0, n - 1);

    for (size_t i = 0; i < a.size(); ++i) {
        cout << a[i];
        if (i < a.size() - 1) cout << " ";
    }
    cout << endl;

    return 0;
}

#include<bits/stdc++.h>
using namespace std;

int main(){
    int n,x;
    cin>>n;
    //定义一个优先队列 默认是降序
    //priority_queue<int,vector<int>,less<int>>q;//从小到大
    priority_queue<int,vector<int>,greater<int>>q;//从大到小
    for(int i=0;i<n;i++){
        cin>>x;
        q.push(x);
    }
    while(!q.empty()){
        cout<<q.top()<<" ";
        q.pop();
    }
    return 0;
}