You've successfully subscribed to The Poor Coder | Hackerrank Solutions
Great! Next, complete checkout for full access to The Poor Coder | Hackerrank Solutions
Welcome back! You've successfully signed in.
Success! Your account is fully activated, you now have access to all content.
Hackerrank Vector-Sort Solution

Hackerrank Vector-Sort Solution

Beeze Aal
Beeze Aal

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)

To know more about vectors, Click Here

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.

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

Solution in cpp

Approach 1.

#include <bits/stdc++.h>

using namespace std;

int main()
{
 vector<long long>v;
 long long int i,n,x;
 cin>>n;
 for(i=0;i<n;i++)
 { cin>>x;
  v.push_back(x);
 }

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

 for(i=0;i<n;i++)
 cout<<v[i]<<" ";
 
 cout<<endl;
 
 return 0;
}

Approach 2.

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


int main() {
	int i, n;
	int size;
	string line;
    vector<int> v;

    cin >> size;
    
    for(i = 0; i < size; i++) {
        cin >> n;
        v.push_back(n);
    }
    
    sort(v.begin(), v.end());

	for (i = 0; i < v.size(); i++) {
		cout << v[i] << ' ';
	}

	

	
	return 0;
}

Approach 3.

#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 */  
    int size,n;
    cin>>size;
    vector<int> v;
    for(int i =0; i<size;i++){
        cin>>n;
        v.push_back(n);
    }
    sort(v.begin(),v.end());
    for(int i =0;i<size;i++){
        cout<<v[i]<<" ";
    }
    
    return 0;
}