#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t–){
int n;
vector v;
cin>>n;
for(int i=0;i<n;i++){
string s;
cin>>s;
v.push_back(s);
}
sort(v.begin() , v.end());
string s;
for(int i=n-1;i>=0;i–){
s+=v.at(i);
}
cout<<s<<endl;
}
return 0;
}
@chetan_aggarwalbX1 you cant just sort it and display it will give wrong output here correct logic
The idea is to use any comparison based sorting algorithm. In the used sorting algorithm, instead of using the default comparison, write a comparison function myCompare() and use it to sort numbers. Given two numbers X and Y, how should myCompare() decide which number to put first – we compare two numbers XY (Y appended at the end of X) and YX (X appended at the end of Y). If XY is larger, then X should come before Y in output, else Y should come before. For example, let X and Y be 542 and 60. To compare X and Y, we compare 54260 and 60542. Since 60542 is greater than 54260, we put Y first.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.