Envío 2493

Código

#include<iostream>
#include<algorithm>
#include<vector>

using namespace std;

void sortVec(vector<int>& a){
    int i=1;
    while(i<a.size()){
        int j = i;
        while(j>0 && a[j-1]>a[j]){
            swap(a[j],a[j-1]);
            j--;
        }
        i++;
    }
}

int main(){
    int n;
    cin>>n;
    vector<int> vals(n);
    for(auto &val: vals){
        cin>>val;
    }
    sortVec(vals);
    for(int val: vals){
        cout<<val<<" ";
    }
    cout<<"\n";
    return 0;
}