Telefono linija
- [1] 2014-04-15 13:05 (50)
- [2] 2014-04-15 13:06 (50)
- [3] 2014-04-15 13:11 (50)
- [4] 2014-04-15 13:13 (50)
- [5] 2014-04-16 13:07 (50)
- [6] 2014-04-16 13:15 (50)
- [7] 2017-10-22 12:51 (0)
- [8] 2017-10-22 12:53 (100)
- [9] 2018-01-19 20:01 (100)
- [10] 2022-05-19 20:42 (100)
Taškai: 0
Compile: FAIL
linija.cpp: In function ‘ll findMax()’: linija.cpp:91:38: error: use of ‘auto’ in lambda parameter declaration only available with -std=c++14 or -std=gnu++14 sort(edges.begin(), edges.end(), [](auto a, auto b) -> bool { ^ linija.cpp:91:46: error: use of ‘auto’ in lambda parameter declaration only available with -std=c++14 or -std=gnu++14 sort(edges.begin(), edges.end(), [](auto a, auto b) -> bool { ^ linija.cpp: In lambda function: linija.cpp:92:12: error: request for member ‘first’ in ‘a’, which is of non-class type ‘int’ return a.first > b.first; ^ linija.cpp:92:22: error: request for member ‘first’ in ‘b’, which is of non-class type ‘int’ return a.first > b.first; ^ linija.cpp: In function ‘ll findMin()’: linija.cpp:107:38: error: use of ‘auto’ in lambda parameter declaration only available with -std=c++14 or -std=gnu++14 sort(edges.begin(), edges.end(), [](auto a, auto b) -> bool { ^ linija.cpp:107:46: error: use of ‘auto’ in lambda parameter declaration only available with -std=c++14 or -std=gnu++14 sort(edges.begin(), edges.end(), [](auto a, auto b) -> bool { ^ linija.cpp: In lambda function: linija.cpp:108:12: error: request for member ‘first’ in ‘a’, which is of non-class type ‘int’ return a.first < b.first; ^ linija.cpp:108:22: error: request for member ‘first’ in ‘b’, which is of non-class type ‘int’ return a.first < b.first; ^ In file included from /usr/include/c++/5/bits/stl_algobase.h:71:0, from /usr/include/c++/5/bits/char_traits.h:39, from /usr/include/c++/5/ios:40, from /usr/include/c++/5/ostream:38, from /usr/include/c++/5/iostream:39, from linija.cpp:2: /usr/include/c++/5/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Iter_comp_iter<_Compare>::operator()(_Iterator1, _Iterator2) [with _Iterator1 = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Iterator2 = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = findMax()::<lambda(int, int)>]’: /usr/include/c++/5/bits/stl_algo.h:1842:14: required from ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findMax()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_algo.h:1880:25: required from ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findMax()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_algo.h:1966:31: required from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findMax()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_algo.h:4729:18: required from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = findMax()::<lambda(int, int)>]’ linija.cpp:93:3: required from here /usr/include/c++/5/bits/predefined_ops.h:123:46: error: no match for call to ‘(findMax()::<lambda(int, int)>) (std::pair<int, std::pair<int, int> >&, std::pair<int, std::pair<int, int> >&)’ { return bool(_M_comp(*__it1, *__it2)); } ^ /usr/include/c++/5/bits/predefined_ops.h:123:46: note: candidate: bool (*)(int, int) <conversion> /usr/include/c++/5/bits/predefined_ops.h:123:46: note: candidate expects 3 arguments, 3 provided linija.cpp:91:57: note: candidate: findMax()::<lambda(int, int)> sort(edges.begin(), edges.end(), [](auto a, auto b) -> bool { ^ linija.cpp:91:57: note: no known conversion for argument 1 from ‘std::pair<int, std::pair<int, int> >’ to ‘int’ In file included from /usr/include/c++/5/bits/stl_algobase.h:71:0, from /usr/include/c++/5/bits/char_traits.h:39, from /usr/include/c++/5/ios:40, from /usr/include/c++/5/ostream:38, from /usr/include/c++/5/iostream:39, from linija.cpp:2: /usr/include/c++/5/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Iter_comp_iter<_Compare>::operator()(_Iterator1, _Iterator2) [with _Iterator1 = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Iterator2 = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = findMin()::<lambda(int, int)>]’: /usr/include/c++/5/bits/stl_algo.h:1842:14: required from ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findMin()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_algo.h:1880:25: required from ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findMin()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_algo.h:1966:31: required from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findMin()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_algo.h:4729:18: required from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = findMin()::<lambda(int, int)>]’ linija.cpp:109:3: required from here /usr/include/c++/5/bits/predefined_ops.h:123:46: error: no match for call to ‘(findMin()::<lambda(int, int)>) (std::pair<int, std::pair<int, int> >&, std::pair<int, std::pair<int, int> >&)’ { return bool(_M_comp(*__it1, *__it2)); } ^ /usr/include/c++/5/bits/predefined_ops.h:123:46: note: candidate: bool (*)(int, int) <conversion> /usr/include/c++/5/bits/predefined_ops.h:123:46: note: candidate expects 3 arguments, 3 provided linija.cpp:107:57: note: candidate: findMin()::<lambda(int, int)> sort(edges.begin(), edges.end(), [](auto a, auto b) -> bool { ^ linija.cpp:107:57: note: no known conversion for argument 1 from ‘std::pair<int, std::pair<int, int> >’ to ‘int’ In file included from /usr/include/c++/5/bits/stl_algobase.h:71:0, from /usr/include/c++/5/bits/char_traits.h:39, from /usr/include/c++/5/ios:40, from /usr/include/c++/5/ostream:38, from /usr/include/c++/5/iostream:39, from linija.cpp:2: /usr/include/c++/5/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 = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = findMax()::<lambda(int, int)>]’: /usr/include/c++/5/bits/stl_algo.h:1823:20: required from ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<findMax()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_algo.h:1850:36: required from ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findMax()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_algo.h:1880:25: required from ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findMax()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_algo.h:1966:31: required from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findMax()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_algo.h:4729:18: required from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = findMax()::<lambda(int, int)>]’ linija.cpp:93:3: required from here /usr/include/c++/5/bits/predefined_ops.h:169:37: error: no match for call to ‘(findMax()::<lambda(int, int)>) (std::pair<int, std::pair<int, int> >&, std::pair<int, std::pair<int, int> >&)’ { return bool(_M_comp(__val, *__it)); } ^ /usr/include/c++/5/bits/predefined_ops.h:169:37: note: candidate: bool (*)(int, int) <conversion> /usr/include/c++/5/bits/predefined_ops.h:169:37: note: candidate expects 3 arguments, 3 provided linija.cpp:91:57: note: candidate: findMax()::<lambda(int, int)> sort(edges.begin(), edges.end(), [](auto a, auto b) -> bool { ^ linija.cpp:91:57: note: no known conversion for argument 1 from ‘std::pair<int, std::pair<int, int> >’ to ‘int’ In file included from /usr/include/c++/5/bits/stl_algobase.h:71:0, from /usr/include/c++/5/bits/char_traits.h:39, from /usr/include/c++/5/ios:40, from /usr/include/c++/5/ostream:38, from /usr/include/c++/5/iostream:39, from linija.cpp:2: /usr/include/c++/5/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 = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = findMin()::<lambda(int, int)>]’: /usr/include/c++/5/bits/stl_algo.h:1823:20: required from ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<findMin()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_algo.h:1850:36: required from ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findMin()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_algo.h:1880:25: required from ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findMin()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_algo.h:1966:31: required from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findMin()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_algo.h:4729:18: required from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = findMin()::<lambda(int, int)>]’ linija.cpp:109:3: required from here /usr/include/c++/5/bits/predefined_ops.h:169:37: error: no match for call to ‘(findMin()::<lambda(int, int)>) (std::pair<int, std::pair<int, int> >&, std::pair<int, std::pair<int, int> >&)’ { return bool(_M_comp(__val, *__it)); } ^ /usr/include/c++/5/bits/predefined_ops.h:169:37: note: candidate: bool (*)(int, int) <conversion> /usr/include/c++/5/bits/predefined_ops.h:169:37: note: candidate expects 3 arguments, 3 provided linija.cpp:107:57: note: candidate: findMin()::<lambda(int, int)> sort(edges.begin(), edges.end(), [](auto a, auto b) -> bool { ^ linija.cpp:107:57: note: no known conversion for argument 1 from ‘std::pair<int, std::pair<int, int> >’ to ‘int’ In file included from /usr/include/c++/5/bits/stl_algobase.h:71:0, from /usr/include/c++/5/bits/char_traits.h:39, from /usr/include/c++/5/ios:40, from /usr/include/c++/5/ostream:38, from /usr/include/c++/5/iostream:39, from linija.cpp:2: /usr/include/c++/5/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Value = std::pair<int, std::pair<int, int> >; _Compare = findMax()::<lambda(int, int)>]’: /usr/include/c++/5/bits/stl_heap.h:129:48: required from ‘void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<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<findMax()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_heap.h:228:23: required from ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<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<findMax()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_heap.h:333:22: required from ‘void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findMax()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_algo.h:1669:23: required from ‘void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findMax()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_algo.h:1928:25: required from ‘void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findMax()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_algo.h:1943:27: required from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findMax()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_algo.h:1963:25: required from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findMax()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_algo.h:4729:18: required from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = findMax()::<lambda(int, int)>]’ linija.cpp:93:3: required from here /usr/include/c++/5/bits/predefined_ops.h:144:37: error: no match for call to ‘(findMax()::<lambda(int, int)>) (std::pair<int, std::pair<int, int> >&, std::pair<int, std::pair<int, int> >&)’ { return bool(_M_comp(*__it, __val)); } ^ /usr/include/c++/5/bits/predefined_ops.h:144:37: note: candidate: bool (*)(int, int) <conversion> /usr/include/c++/5/bits/predefined_ops.h:144:37: note: candidate expects 3 arguments, 3 provided linija.cpp:91:57: note: candidate: findMax()::<lambda(int, int)> sort(edges.begin(), edges.end(), [](auto a, auto b) -> bool { ^ linija.cpp:91:57: note: no known conversion for argument 1 from ‘std::pair<int, std::pair<int, int> >’ to ‘int’ In file included from /usr/include/c++/5/bits/stl_algobase.h:71:0, from /usr/include/c++/5/bits/char_traits.h:39, from /usr/include/c++/5/ios:40, from /usr/include/c++/5/ostream:38, from /usr/include/c++/5/iostream:39, from linija.cpp:2: /usr/include/c++/5/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Value = std::pair<int, std::pair<int, int> >; _Compare = findMin()::<lambda(int, int)>]’: /usr/include/c++/5/bits/stl_heap.h:129:48: required from ‘void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<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<findMin()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_heap.h:228:23: required from ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<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<findMin()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_heap.h:333:22: required from ‘void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findMin()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_algo.h:1669:23: required from ‘void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findMin()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_algo.h:1928:25: required from ‘void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findMin()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_algo.h:1943:27: required from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findMin()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_algo.h:1963:25: required from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findMin()::<lambda(int, int)> >]’ /usr/include/c++/5/bits/stl_algo.h:4729:18: required from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = findMin()::<lambda(int, int)>]’ linija.cpp:109:3: required from here /usr/include/c++/5/bits/predefined_ops.h:144:37: error: no match for call to ‘(findMin()::<lambda(int, int)>) (std::pair<int, std::pair<int, int> >&, std::pair<int, std::pair<int, int> >&)’ { return bool(_M_comp(*__it, __val)); } ^ /usr/include/c++/5/bits/predefined_ops.h:144:37: note: candidate: bool (*)(int, int) <conversion> /usr/include/c++/5/bits/predefined_ops.h:144:37: note: candidate expects 3 arguments, 3 provided linija.cpp:107:57: note: candidate: findMin()::<lambda(int, int)> sort(edges.begin(), edges.end(), [](auto a, auto b) -> bool { ^ linija.cpp:107:57: note: no known conversion for argument 1 from ‘std::pair<int, std::pair<int, int> >’ to ‘int’ linija.cpp: In function ‘int main()’: linija.cpp:132:34: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] freopen("linija.in", "r", stdin); ^ linija.cpp:133:36: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] freopen("linija.out", "w", stdout); ^
| nr. | result | time | message |
|---|