diff options
| author | Mohammad Sajid Anwar <Mohammad.Anwar@yahoo.com> | 2024-01-29 02:16:30 +0000 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2024-01-29 02:16:30 +0000 |
| commit | f193e95f770bb46d18c1a69d507e33cfc574622f (patch) | |
| tree | 0b7a1a5d7a059db43335bc7c6af0571e7e32a693 /challenge-253/witawayar/cpp/ch-2.cpp | |
| parent | b3d01f8327d7fdcf7b713be5fda922a4afbf8d1a (diff) | |
| parent | 3fa6b95dd9cb2cfc0d45652a06bf91e36678b67f (diff) | |
| download | perlweeklychallenge-club-f193e95f770bb46d18c1a69d507e33cfc574622f.tar.gz perlweeklychallenge-club-f193e95f770bb46d18c1a69d507e33cfc574622f.tar.bz2 perlweeklychallenge-club-f193e95f770bb46d18c1a69d507e33cfc574622f.zip | |
Merge pull request #9476 from mustafaaydn/challenge_253
Solutions for the 253rd challenge
Diffstat (limited to 'challenge-253/witawayar/cpp/ch-2.cpp')
| -rw-r--r-- | challenge-253/witawayar/cpp/ch-2.cpp | 58 |
1 files changed, 58 insertions, 0 deletions
diff --git a/challenge-253/witawayar/cpp/ch-2.cpp b/challenge-253/witawayar/cpp/ch-2.cpp new file mode 100644 index 0000000000..cd14a85981 --- /dev/null +++ b/challenge-253/witawayar/cpp/ch-2.cpp @@ -0,0 +1,58 @@ +// g++ -Wall -Wextra -Wpedantic -std=c++17 cpp/ch-2.cpp +#include <algorithm> // transform +#include <iostream> // cout +#include <numeric> // accumulate +#include <sstream> // stringstream +#include <tuple> // tie +#include <vector> + +std::vector<int> fun(std::vector<std::vector<int>> const& matrix) { + std::vector<std::pair<int, std::vector<int>>> aug_matrix; + for (std::size_t idx{0}; idx < matrix.size(); ++idx) { + aug_matrix.emplace_back(idx, matrix[idx]); + } + std::sort(aug_matrix.begin(), aug_matrix.end(), + [](auto& vec_a, auto& vec_b) { + auto a_sum = std::accumulate(vec_a.second.cbegin(), vec_a.second.cend(), 0); + auto b_sum = std::accumulate(vec_b.second.cbegin(), vec_b.second.cend(), 0); + return std::tie(a_sum, vec_a.first) < std::tie(b_sum, vec_b.first); + }); + std::vector<int> sorter_indexes; + std::transform(aug_matrix.cbegin(), aug_matrix.cend(), + std::back_inserter(sorter_indexes), + [](auto& pair) { return pair.first; }); + return sorter_indexes; +} + +int main(void) { + // Tests + std::vector<std::pair<std::vector<std::vector<int>>, std::vector<int>>> tests = { + { + { + {1, 1, 0, 0, 0}, + {1, 1, 1, 1, 0}, + {1, 0, 0, 0, 0}, + {1, 1, 0, 0, 0}, + {1, 1, 1, 1, 1} + }, {2, 0, 3, 1, 4}}, + { + { + {1, 0, 0, 0}, + {1, 1, 1, 1}, + {1, 0, 0, 0}, + {1, 0, 0, 0} + }, {0, 2, 3, 1}} + }; + + std::size_t test_case{0}; + for (const auto& [input, expected_output] : tests) { + auto got = fun(input); + if (got != expected_output) { + std::stringstream error_msg; + error_msg << "Failed at " << test_case++ << "th test case"; + throw std::runtime_error(error_msg.str()); + } + } + + std::cout << "done-testing, success\n"; +} |
