Borderou de evaluare (job #2186997)
Utilizator | Data | 26 martie 2018 09:35:54 | |
---|---|---|---|
Problema | Elementul majoritar | Status | done |
Runda | bpc10 | Compilator | cpp | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
In file included from /usr/include/c++/6/algorithm:62:0,
from user.cpp:1:
/usr/include/c++/6/bits/stl_algo.h: In instantiation of ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::_Rb_tree_iterator<std::pair<const int, int> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(const std::pair<int, int>&, const std::pair<int, int>&)> >]’:
/usr/include/c++/6/bits/stl_algo.h:4739:18: required from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = std::_Rb_tree_iterator<std::pair<const int, int> >; _Compare = main()::<lambda(const std::pair<int, int>&, const std::pair<int, int>&)>]’
user.cpp:20:154: required from here
/usr/include/c++/6/bits/stl_algo.h:1966:22: error: no match for ‘operator-’ (operand types are ‘std::_Rb_tree_iterator<std::pair<const int, int> >’ and ‘std::_Rb_tree_iterator<std::pair<const int, int> >’)
std::__lg(__last - __first) * 2,
~~~~~~~^~~~~~~~~
In file included from /usr/include/c++/6/bits/stl_algobase.h:67:0,
from /usr/include/c++/6/algorithm:61,
from user.cpp:1:
/usr/include/c++/6/bits/stl_iterator.h:333:5: note: candidate: template<class _Iterator> decltype ((__x.base() - __y.base())) std::operator-(const std::reverse_iterator<_Iterator>&, const std::reverse_iterator<_Iterator>&)
operator-(const reverse_iterator<_Iterator>& __x,
^~~~~~~~
/usr/include/c++/6/bits/stl_iterator.h:333:5: note: template argument deduction/substitution failed:
In file included from /usr/include/c++/6/algorithm:62:0,
from user.cpp:1:
/usr/include/c++/6/bits/stl_algo.h:1966:22: note: ‘std::_Rb_tree_iterator<std::pair<const int, int> >’ is not derived from ‘const std::reverse_iterator<_Iterator>’
std::__lg(__last - __first) * 2,
~~~~~~~^~~~~~~~~
In file included from /usr/include/c++/6/bits/stl_algobase.h:67:0,
from /usr/include/c++/6/algorithm:61,
from user.cpp:1:
/usr/include/c++/6/bits/stl_iterator.h:387:5: note: candidate: template<class _IteratorL, class _IteratorR> decltype ((__y.base() - __x.base())) std::operator-(const std::reverse_iterator<_Iterator>&, const std::reverse_iterator<_IteratorR>&)
operator-(const reverse_iterator<_IteratorL>& __x,
^~~~~~~~
/usr/include/c++/6/bits/stl_iterator.h:387:5: note: template argument deduction/substitution failed:
In file included from /usr/include/c++/6/algorithm:62:0,
from user.cpp:1:
/usr/include/c++/6/bits/stl_algo.h:1966:22: note: ‘std::_Rb_tree_iterator<std::pair<const int, int> >’ is not derived from ‘const std::reverse_iterator<_Iterator>’
std::__lg(__last - __first) * 2,
~~~~~~~^~~~~~~~~
In file included from /usr/include/c++/6/bits/stl_algobase.h:67:0,
from /usr/include/c++/6/algorithm:61,
from user.cpp:1:
/usr/include/c++/6/bits/stl_iterator.h:1186:5: note: candidate: template<class _IteratorL, class _IteratorR> decltype ((__x.base() - __y.base())) std::operator-(const std::move_iterator<_IteratorL>&, const std::move_iterator<_IteratorR>&)
operator-(const move_iterator<_IteratorL>& __x,
^~~~~~~~
/usr/include/c++/6/bits/stl_iterator.h:1186:5: note: template argument deduction/substitution failed:
In file included from /usr/include/c++/6/algorithm:62:0,
from user.cpp:1:
/usr/include/c++/6/bits/stl_algo.h:1966:22: note: ‘std::_Rb_tree_iterator<std::pair<const int, int> >’ is not derived from ‘const std::move_iterator<_IteratorL>’
std::__lg(__last - __first) * 2,
~~~~~~~^~~~~~~~~
In file included from /usr/include/c++/6/bits/stl_algobase.h:67:0,
from /usr/include/c++/6/algorithm:61,
from user.cpp:1:
/usr/include/c++/6/bits/stl_iterator.h:1193:5: note: candidate: template<class _Iterator> decltype ((__x.base() - __y.base())) std::operator-(const std::move_iterator<_IteratorL>&, const std::move_iterator<_IteratorL>&)
operator-(const move_iterator<_Iterator>& __x,
^~~~~~~~
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !