Here is my solution!

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


int main() {
    int num_ints, current_int;
    vector<int> ints;
    scanf("%d", &num_ints);
    for (int i = 0; i < num_ints; i++) {
        scanf("%d", &current_int);
        ints.push_back(current_int);
    }
    sort(ints.begin(), ints.end());
    for (int i = 0; i < num_ints; i++) {
        printf("%d ", ints[i]);
    }
    return 0;
}

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


int main() {
int n;
cin>>n;
vector<int> v(n);
for(int i=0;i<n;i++) cin>>v[i];
sort(v.begin(),v.end());
for(int i=0;i<n;i++) cout<<v[i]<<" ";
return 0;

}

Here is Vector-Sort problem solution in c++ - https://programmingoneonone.com/hackerrank-vector-sort-solution-in-cpp.html

include

include

include

include

include

using namespace std;

int main() { int N; cin>>N; vectorv; int i; for ( i=0; i>x; v.push_back(x); } sort(v.begin(),v.end()); for (auto i=v.begin(); i!=v.end(); ++i) { cout<<*i<<" "; } return 0; }

int main() { int n; std::cin >> n; std::vector vec(n);

for (auto &i : vec) std::cin >> i;
std::sort(vec.begin(), vec.end());
for (const auto &i : vec) std::cout << i << ' ';

return 0;

}