#include #include #include #include namespace Challenge { template std::string to_string(const T& n) //std::to_string copy { std::stringstream ss; ss << std::fixed << n; return ss.str(); } template void sort(Iter begin, Iter end) { typedef typename std::iterator_traits::value_type value; std::sort(begin, end, [](const value& a, const value& b) { return to_string(a) + to_string(b) > to_string(b) + to_string(a); }); } } namespace TEST { template std::string to_string(Iter begin, Iter end, const std::string& separator = "") { std::string r; for(; begin != end; ++begin) r += Challenge::to_string(*begin) + separator; return r; } template void CHECK_IF(std::vector v, const std::string& s2) { std::cout << "Input: " << to_string(v.begin(),v.end(), " ") << std::endl; Challenge::sort(v.begin(),v.end()); std::string s = to_string(v.begin(),v.end()); if(s != s2) { std::cerr << "Got: " << s << std::endl; std::cerr << "Expected: " << s2 << std::endl; throw; } std::cout << "Output: " << s << std::endl << std::endl; } void TESTS() { std::vector vec = {101, 50}; CHECK_IF(vec, "50101"); vec = {3456,34567}; CHECK_IF(vec, "345673456"); vec = {10,1}; CHECK_IF(vec, "110"); vec = {13,4}; CHECK_IF(vec, "413"); vec = {51,2}; CHECK_IF(vec, "512"); vec = {2,3,4,1121,534}; CHECK_IF(vec, "5344321121"); vec = {3,343}; CHECK_IF(vec, "3433"); vec = {0,0,89,98}; CHECK_IF(vec, "988900"); vec = {1,1,1,22,22,333,4444,55,6666,77777,888,999,0,0,0}; CHECK_IF(vec, "9998887777766665544443332222111000"); vec = {34982,3213}; CHECK_IF(vec, "349823213"); vec = {0,15,015}; CHECK_IF(vec, "15130"); vec = {0x34014F0,0x54AE}; CHECK_IF(vec, "5453131221678"); vec = {0b10011001, 0b101}; CHECK_IF(vec, "5153"); vec = {1,2,3,4,5,6,7,8,9}; CHECK_IF(vec, "987654321"); vec = {2,21,29}; CHECK_IF(vec, "29221"); vec = {512,51,5}; CHECK_IF(vec, "551512"); vec = {512,51,5,512}; CHECK_IF(vec, "551512512"); vec = {14871,34144145,6561514,131,133,34441,1231,123,565,62,0, 13,142312,855646,923424,234,21,3,5,1566,0,470, 0}; CHECK_IF(vec, "92342485564665615146256554703444134144145323421156614871142312133131311231231000"); //Add more options here } } int main() { TEST::TESTS(); }

Find largest challenge