Masyvo Užklausos 1

Taškai: 0

Compile: FAIL

masyvo_uzklausos123.cpp: In function ‘int main()’: masyvo_uzklausos123.cpp:32:24: error: use of ‘auto’ in lambda parameter declaration only available with ‘-std=c++14’ or ‘-std=gnu++14’ 32 | sort(q, q + m, [&](auto &a, auto &b) { | ^~~~ masyvo_uzklausos123.cpp:32:33: error: use of ‘auto’ in lambda parameter declaration only available with ‘-std=c++14’ or ‘-std=gnu++14’ 32 | sort(q, q + m, [&](auto &a, auto &b) { | ^~~~ masyvo_uzklausos123.cpp: In lambda function: masyvo_uzklausos123.cpp:33:24: error: request for member ‘first’ in ‘a’, which is of non-class type ‘int’ 33 | int blockA = a.first / block; | ^~~~~ masyvo_uzklausos123.cpp:34:24: error: request for member ‘first’ in ‘b’, which is of non-class type ‘int’ 34 | int blockB = b.first / block; | ^~~~~ masyvo_uzklausos123.cpp:41:22: error: request for member ‘second’ in ‘a’, which is of non-class type ‘int’ 41 | return a.second.first > b.second.first; | ^~~~~~ masyvo_uzklausos123.cpp:41:39: error: request for member ‘second’ in ‘b’, which is of non-class type ‘int’ 41 | return a.second.first > b.second.first; | ^~~~~~ masyvo_uzklausos123.cpp:43:18: error: request for member ‘second’ in ‘a’, which is of non-class type ‘int’ 43 | return a.second.first < b.second.first; | ^~~~~~ masyvo_uzklausos123.cpp:43:35: error: request for member ‘second’ in ‘b’, which is of non-class type ‘int’ 43 | return a.second.first < b.second.first; | ^~~~~~ In file included from /usr/include/c++/11/bits/stl_algobase.h:71, from /usr/include/c++/11/bits/char_traits.h:39, from /usr/include/c++/11/ios:40, from /usr/include/c++/11/ostream:38, from /usr/include/c++/11/iostream:39, from masyvo_uzklausos123.cpp:1: /usr/include/c++/11/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Iter_comp_iter<_Compare>::operator()(_Iterator1, _Iterator2) [with _Iterator1 = std::pair<int, std::pair<int, int> >*; _Iterator2 = std::pair<int, std::pair<int, int> >*; _Compare = main()::<lambda(int&, int&)>]’: /usr/include/c++/11/bits/stl_algo.h:1826:14: required from ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::pair<int, std::pair<int, int> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int&, int&)> >]’ /usr/include/c++/11/bits/stl_algo.h:1866:25: required from ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::pair<int, std::pair<int, int> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int&, int&)> >]’ /usr/include/c++/11/bits/stl_algo.h:1957:31: required from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::pair<int, std::pair<int, int> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int&, int&)> >]’ /usr/include/c++/11/bits/stl_algo.h:4875:18: required from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = std::pair<int, std::pair<int, int> >*; _Compare = main()::<lambda(int&, int&)>]’ masyvo_uzklausos123.cpp:32:9: required from here /usr/include/c++/11/bits/predefined_ops.h:158:30: error: no match for call to ‘(main()::<lambda(int&, int&)>) (std::pair<int, std::pair<int, int> >&, std::pair<int, std::pair<int, int> >&)’ 158 | { return bool(_M_comp(*__it1, *__it2)); } | ~~~~~~~^~~~~~~~~~~~~~~~ masyvo_uzklausos123.cpp:32:20: note: candidate: ‘main()::<lambda(int&, int&)>’ 32 | sort(q, q + m, [&](auto &a, auto &b) { | ^ masyvo_uzklausos123.cpp:32:20: note: no known conversion for argument 1 from ‘std::pair<int, std::pair<int, int> >’ to ‘int&’ In file included from /usr/include/c++/11/bits/stl_algobase.h:71, from /usr/include/c++/11/bits/char_traits.h:39, from /usr/include/c++/11/ios:40, from /usr/include/c++/11/ostream:38, from /usr/include/c++/11/iostream:39, from masyvo_uzklausos123.cpp:1: /usr/include/c++/11/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Val_comp_iter<_Compare>::operator()(_Value&, _Iterator) [with _Value = std::pair<int, std::pair<int, int> >; _Iterator = std::pair<int, std::pair<int, int> >*; _Compare = main()::<lambda(int&, int&)>]’: /usr/include/c++/11/bits/stl_algo.h:1806:20: required from ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::pair<int, std::pair<int, int> >*; _Compare = __gnu_cxx::__ops::_Val_comp_iter<main()::<lambda(int&, int&)> >]’ /usr/include/c++/11/bits/stl_algo.h:1834:36: required from ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::pair<int, std::pair<int, int> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int&, int&)> >]’ /usr/include/c++/11/bits/stl_algo.h:1866:25: required from ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::pair<int, std::pair<int, int> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int&, int&)> >]’ /usr/include/c++/11/bits/stl_algo.h:1957:31: required from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::pair<int, std::pair<int, int> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int&, int&)> >]’ /usr/include/c++/11/bits/stl_algo.h:4875:18: required from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = std::pair<int, std::pair<int, int> >*; _Compare = main()::<lambda(int&, int&)>]’ masyvo_uzklausos123.cpp:32:9: required from here /usr/include/c++/11/bits/predefined_ops.h:240:30: error: no match for call to ‘(main()::<lambda(int&, int&)>) (std::pair<int, std::pair<int, int> >&, std::pair<int, std::pair<int, int> >&)’ 240 | { return bool(_M_comp(__val, *__it)); } | ~~~~~~~^~~~~~~~~~~~~~ masyvo_uzklausos123.cpp:32:20: note: candidate: ‘main()::<lambda(int&, int&)>’ 32 | sort(q, q + m, [&](auto &a, auto &b) { | ^ masyvo_uzklausos123.cpp:32:20: note: no known conversion for argument 1 from ‘std::pair<int, std::pair<int, int> >’ to ‘int&’ In file included from /usr/include/c++/11/bits/stl_algobase.h:71, from /usr/include/c++/11/bits/char_traits.h:39, from /usr/include/c++/11/ios:40, from /usr/include/c++/11/ostream:38, from /usr/include/c++/11/iostream:39, from masyvo_uzklausos123.cpp:1: /usr/include/c++/11/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = std::pair<int, std::pair<int, int> >*; _Value = std::pair<int, std::pair<int, int> >; _Compare = main()::<lambda(int&, int&)>]’: /usr/include/c++/11/bits/stl_heap.h:139:48: required from ‘void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = std::pair<int, std::pair<int, int> >*; _Distance = long int; _Tp = std::pair<int, std::pair<int, int> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<main()::<lambda(int&, int&)> >]’ /usr/include/c++/11/bits/stl_heap.h:246:23: required from ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = std::pair<int, std::pair<int, int> >*; _Distance = long int; _Tp = std::pair<int, std::pair<int, int> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int&, int&)> >]’ /usr/include/c++/11/bits/stl_heap.h:355:22: required from ‘void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = std::pair<int, std::pair<int, int> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int&, int&)> >]’ /usr/include/c++/11/bits/stl_algo.h:1646:23: required from ‘void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::pair<int, std::pair<int, int> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int&, int&)> >]’ /usr/include/c++/11/bits/stl_algo.h:1917:25: required from ‘void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::pair<int, std::pair<int, int> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int&, int&)> >]’ /usr/include/c++/11/bits/stl_algo.h:1933:27: required from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = std::pair<int, std::pair<int, int> >*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int&, int&)> >]’ /usr/include/c++/11/bits/stl_algo.h:1954:25: required from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::pair<int, std::pair<int, int> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int&, int&)> >]’ /usr/include/c++/11/bits/stl_algo.h:4875:18: required from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = std::pair<int, std::pair<int, int> >*; _Compare = main()::<lambda(int&, int&)>]’ masyvo_uzklausos123.cpp:32:9: required from here /usr/include/c++/11/bits/predefined_ops.h:196:30: error: no match for call to ‘(main()::<lambda(int&, int&)>) (std::pair<int, std::pair<int, int> >&, std::pair<int, std::pair<int, int> >&)’ 196 | { return bool(_M_comp(*__it, __val)); } | ~~~~~~~^~~~~~~~~~~~~~ masyvo_uzklausos123.cpp:32:20: note: candidate: ‘main()::<lambda(int&, int&)>’ 32 | sort(q, q + m, [&](auto &a, auto &b) { | ^ masyvo_uzklausos123.cpp:32:20: note: no known conversion for argument 1 from ‘std::pair<int, std::pair<int, int> >’ to ‘int&’

nr.resulttimemessage