Saturday, 15 July 2017

Big Sorting Hacker Rank Problem Solution.

Problem :

Consider an array of numeric strings, , where each string is a positive number with anywhere from  to  digits. Sort the array's elements in non-decreasing (i.e., ascending) order of their real-world integer values and print each element of the sorted array on a new line.
Input Format
The first line contains an integer, , denoting the number of strings in .
Each of the  subsequent lines contains a string of integers describing an element of the array.
Constraints
  • Each string is guaranteed to represent a positive integer without leading zeros.
  • The total number of digits across all strings in  is between  and  (inclusive).
Output Format
Print each element of the sorted array on a new line.
Sample Input 0
6
31415926535897932384626433832795
1
3
10
3
5
Sample Output 0
1
3
3
5
10
31415926535897932384626433832795
Explanation 0
The initial array of strings is . When we order each string by the real-world integer value it represents, we get:
We then print each value on a new line, from smallest to largest.
Solution:
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
/*
    * Prosen Ghosh
    * American International University - Bangladesh (AIUB)
    *
*/
bool check(string a, string b){ return a.length() == b.length() ? a > b : a.length() > b.length(); } int main() { int n; cin >> n; vector<string> ar; for(int i = 0; i < n; i++){ string a;cin >> a; ar.push_back(a); } sort(ar.begin(),ar.end(),check); for(int i = ar.size() - 1; i >= 0; i--)cout << ar[i] << endl; return 0; }

No comments:

Post a Comment