个人思路

#include<iostream>
#include<algorithm>//引用sort函数
using namespace std;
int main(){
    int n;
    cin>>n;

    int a[100005];//防止溢出
    
    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 <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector a(n); for (long long &x : a) cin >> x; sort(a.begin(), a.end()); for (int i = 0; i < n; i++) { if (i) cout << ' '; cout << a[i]; } cout << '\n'; }