7-12 排序 (25分)

7-12 排序 (25分)

AC代碼

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
    int n;
    scanf("%d", &n);
    vector<long long> v(n);
    for (int i = 0; i < n; i++) scanf("%lld", &v[i]);
    sort(v.begin(), v.end());
    for (int i = 0; i < n; i++){
        if (i) printf(" ");
        printf("%lld", v[i]);
    }
    return 0;
}