Vector-Sort

Sort by

recency

|

304 Discussions

|

  • + 0 comments
    #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;
    

    }

  • + 0 comments

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

  • + 0 comments

    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; }

  • + 0 comments

    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;
    

    }

  • + 0 comments
    int n;
        cin >> n;
    
        vector<int> numbers(n);
        for (int i = 0; i < n; i++) {
            cin >> numbers[i];
        }
    
        sort(numbers.begin(), numbers.end());
    
        for (int i = 0; i < n; i++) {
            cout << numbers[i] << " ";
        }
        cout << endl;