For this Question: Given an array of N integers, your task is to calculate the largest number that can be formed by appending the numbers from the given array.
For eg:- If the numbers are { 10, 3, 31} then the largest number will be 33110First line of input contains a single integer N, next line contains N space separated integers depicting values of array.

Constraints:-
1 < = N < = 100000
1 < = Arr[i] < = 100000Print the largest number that can be formed using the array elements.Sample Input:-
3
10 3 31

Sample Output:-
33110

Sample Input:-
5
8 9 10 11 12

Sample Output:-
98121110, I have written this Solution Code: // C++ program to find sum of all minimum and maximum
// elements Of Sub-array Size k.
#include<bits/stdc++.h>
using namespace std;
#define int long long int
int myCompare(string X, string Y)
{
    // first append Y at the end of X
    string XY = X.append(Y);

    // then append X at the end of Y
    string YX = Y.append(X);

    // Now see which of the two formed numbers is greater
    return XY.compare(YX) > 0 ? 1: 0;
}

// The main function that prints the arrangement with the largest value.
// The function accepts a vector of strings
void printLargest(vector<string> arr)
{
    // Sort the numbers using library sort function. The function uses
    // our comparison function myCompare() to compare two strings.
    // See http://www.cplusplus.com/reference/algorithm/sort/ for details
    sort(arr.begin(), arr.end(), myCompare);

    for (int i=0; i < arr.size() ; i++ )
        cout << arr[i];
}

// Driver program to test above functions
signed  main()
{

     int n,k;
     cin>>n;
vector<string> v(n);
for(int i=0;i<n;i++){
    cin>>v[i];
}
printLargest(v);
	return 0;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not?