7-1 排序 分数 15

#include
#include
#include
using namespace std;

int main() 
{
    int n = 0;
    cin >> n;

    vector<int> v;

    int x = 0;
    for (int i = 0; i < n; i++) 
    {
        cin >> x;
        v.push_back(x);
    }
    sort(v.begin(), v.end());
    for (auto it = v.begin(); it != v.end(); it++) 
    {
        if (it == v.begin())
            cout << *it;
        else 
            cout << " " << *it;
    }
}