`

int main() { vector list; int count = 0; cin >> count;

for (int x = 0, y = 0; x < count; x++) { cin >> y; list.push_back(y); }

sort(list.begin(), list.end());

for(int x = 0; x < list.size(); x++) cout << list[x] << " ";

return 0;

} `

int main() {

/* Enter your code here. Read input from STDIN. Print output to STDOUT */   
int size;
cin>>size;

vector <int> arr(size);

for(int &num : arr){
    cin>>num;
}

sort(arr.begin(),arr.end());

for(int sort : arr){
    cout<<sort<<" ";
}
return 0;

}

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