Eroare de compilare: In file included from /usr/include/c++/12.2.1/algorithm:61, from main.cpp:2: /usr/include/c++/12.2.1/bits/stl_algo.h: In instantiation of 'constexpr void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int (*)[3]; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<minimumMetroCost(int, int, int)::<lambda(const int*, const int*)> >]': /usr/include/c++/12.2.1/bits/stl_algo.h:1849:25: required from 'constexpr void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int (*)[3]; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<minimumMetroCost(int, int, int)::<lambda(const int*, const int*)> >]' /usr/include/c++/12.2.1/bits/stl_algo.h:1940:31: required from 'constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int (*)[3]; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<minimumMetroCost(int, int, int)::<lambda(const int*, const int*)> >]' /usr/include/c++/12.2.1/bits/stl_algo.h:4853:18: required from 'constexpr void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = int (*)[3]; _Compare = minimumMetroCost(int, int, int)::<lambda(const int*, const int*)>]' main.cpp:29:9: required from here /usr/include/c++/12.2.1/bits/stl_algo.h:1812:17: error: array must be initialized with a brace-enclosed initializer 1812 | __val = _GLIBCXX_MOVE(*__i); | ^~~~~ /usr/include/c++/12.2.1/bits/stl_algo.h:1814:24: error: invalid array assignment 1814 | *__first = _GLIBCXX_MOVE(__val); | ^ In file included from /usr/include/c++/12.2.1/bits/stl_algo.h:60: /usr/include/c++/12.2.1/bits/stl_heap.h: In instantiation of 'constexpr void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = int (*)[3]; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<minimumMetroCost(int, int, int)::<lambda(const int*, const int*)> >]': /usr/include/c++/12.2.1/bits/stl_algo.h:1629:23: required from 'constexpr void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int (*)[3]; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<minimumMetroCost(int, int, int)::<lambda(const int*, const int*)> >]' /usr/include/c++/12.2.1/bits/stl_algo.h:1900:25: required from 'constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int (*)[3]; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<minimumMetroCost(int, int, int)::<lambda(const int*, const int*)> >]' /usr/include/c++/12.2.1/bits/stl_algo.h:1916:27: required from 'constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = int (*)[3]; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<minimumMetroCost(int, int, int)::<lambda(const int*, const int*)> >]' /usr/include/c++/12.2.1/bits/stl_algo.h:1937:25: required from 'constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int (*)[3]; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<minimumMetroCost(int, int, int)::<lambda(const int*, const int*)> >]' /usr/include/c++/12.2.1/bits/stl_algo.h:4853:18: required from 'constexpr void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = int (*)[3]; _Compare = minimumMetroCost(int, int, int)::<lambda(const int*, const int*)>]' main.cpp:29:9: required from here /usr/include/c++/12.2.1/bits/stl_heap.h:355:22: error: array must be initialized with a brace-enclosed initializer 355 | _ValueType __value = _GLIBCXX_MOVE(*(__first + __parent)); | ^~~~~~~ /usr/include/c++/12.2.1/bits/stl_heap.h: In instantiation of 'constexpr void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = int (*)[3]; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<minimumMetroCost(int, int, int)::<lambda(const int*, const int*)> >]': /usr/include/c++/12.2.1/bits/stl_algo.h:1632:19: required from 'constexpr void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int (*)[3]; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<minimumMetroCost(int, int, int)::<lambda(const int*, const int*)> >]' /usr/include/c++/12.2.1/bits/stl_algo.h:1900:25: required from 'constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int (*)[3]; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<minimumMetroCost(int, int, int)::<lambda(const int*, const int*)> >]' /usr/include/c++/12.2.1/bits/stl_algo.h:1916:27: required from 'constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = int (*)[3]; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<minimumMetroCost(int, int, int)::<lambda(const int*, const int*)> >]' /usr/include/c++/12.2.1/bits/stl_algo.h:1937:25: required from 'constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int (*)[3]; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<minimumMetroCost(int, int, int)::<lambda(const int*, const int*)> >]' /usr/include/c++/12.2.1/bits/stl_algo.h:4853:18: required from 'constexpr void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = int (*)[3]; _Compare = minimumMetroCost(int, int, int)::<lambda(const int*, const int*)>]' main.cpp:29:9: required from here /usr/include/c++/12.2.1/bits/stl_heap.h:262:18: error: array must be initialized with a brace-enclosed initializer 262 | _ValueType __value = _GLIBCXX_MOVE(*__result); | ^~~~~~~ /usr/include/c++/12.2.1/bits/stl_heap.h:263:17: error: invalid array assignment 263 | *__result = _GLIBCXX_MOVE(*__first); | ^ Non zero exit status: 1