Vector - Sort in c++ : Hacker Rank Solution : Techno Learner


Objective

You are given  integers.Sort the  integers and print the sorted order.
Store the  integers in a vector.Vectors are sequence containers representing arrays that can change in size.
Declaration:
vector<int>v; (creates an empty vector of integers)
Size:
int size=v.size();
Pushing an integer into a vector:
v.push_back(x);(where x is an integer.The size increases by 1 after this.)
Popping the last element from the vector:
v.pop_back(); (After this the size decreases by 1)
Sorting a vector:
sort(v.begin(),v.end()); (Will sort all the elements in the vector)
Input Format
The first line of the input contains  where  is the number of integers. The next line contains  integers.
Constraints

, where  is the  integer in the vector
, where  is the  integer in the vector.

Output Format

Print the integers in the sorted order one by one in a single line followed by a space.

Sample Input

       5

    1 6 10 8 4

Sample Output

    1 4 6 8 10


 


            Table             Laptop Cleaning Kit       Laptop Stand Desk




Techno Learner

Solution  C++ :



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


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    
    vector <int> a;
    int n, k;
    cin >> n;
    
    for (int i=0; i<n; i++) {
        cin >> k;
        a.push_back(k);
    }
    
    sort(a.begin(), a.end());
    
    for(int i=0; i<n; i++) {
        cout << a[i] << " ";
    }
    
    return 0;
}


 


            Table             Laptop Cleaning Kit       Laptop Stand Desk



1 Comments

Let's Learn Something New

We are a passionate developers constantly working to create solution of Competetive Coding Programming problems that's accurate and easier to understand.