Borderou de evaluare (job #249961)

Eroare de compilare: user.cpp: In function ‘int main()’: user.cpp:33:14: warning: variable ‘v’ set but not used [-Wunused-but-set-variable] In file included from /usr/include/c++/4.6/algorithm:63:0, from user.cpp:2: /usr/include/c++/4.6/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*, _Compare = int (*)(obstacol, obstacol)]’: /usr/include/c++/4.6/bits/stl_algo.h:2196:4: instantiated from ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*, _Compare = int (*)(obstacol, obstacol)]’ /usr/include/c++/4.6/bits/stl_algo.h:5447:4: instantiated from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = int*, _Compare = int (*)(obstacol, obstacol)]’ user.cpp:30:24: instantiated from here /usr/include/c++/4.6/bits/stl_algo.h:2129:4: error: could not convert ‘* __i’ from ‘int’ to ‘obstacol’ /usr/include/c++/4.6/bits/stl_algo.h: In function ‘void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*, _Compare = int (*)(obstacol, obstacol)]’: /usr/include/c++/4.6/bits/stl_algo.h:5295:7: instantiated from ‘void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = int*, _Compare = int (*)(obstacol, obstacol)]’ /usr/include/c++/4.6/bits/stl_algo.h:2301:8: instantiated from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = int*, _Size = int, _Compare = int (*)(obstacol, obstacol)]’ /usr/include/c++/4.6/bits/stl_algo.h:5445:4: instantiated from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = int*, _Compare = int (*)(obstacol, obstacol)]’ user.cpp:30:24: instantiated from here /usr/include/c++/4.6/bits/stl_algo.h:1918:2: error: could not convert ‘* __i’ from ‘int’ to ‘obstacol’ /usr/include/c++/4.6/bits/stl_algo.h: In function ‘void std::__move_median_first(_Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = int*, _Compare = int (*)(obstacol, obstacol)]’: /usr/include/c++/4.6/bits/stl_algo.h:2264:7: instantiated from ‘_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*, _Compare = int (*)(obstacol, obstacol)]’ /usr/include/c++/4.6/bits/stl_algo.h:2306:62: instantiated from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = int*, _Size = int, _Compare = int (*)(obstacol, obstacol)]’ /usr/include/c++/4.6/bits/stl_algo.h:5445:4: instantiated from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = int*, _Compare = int (*)(obstacol, obstacol)]’ user.cpp:30:24: instantiated from here /usr/include/c++/4.6/bits/stl_algo.h:112:7: error: could not convert ‘* __a’ from ‘int’ to ‘obstacol’ /usr/include/c++/4.6/bits/stl_algo.h:114:4: error: could not convert ‘* __b’ from ‘int’ to ‘obstacol’ /usr/include/c++/4.6/bits/stl_algo.h:2264:7: instantiated from ‘_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*, _Compare = int (*)(obstacol, obstacol)]’ /usr/include/c++/4.6/bits/stl_algo.h:2306:62: instantiated from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = int*, _Size = int, _Compare = int (*)(obstacol, obstacol)]’ /usr/include/c++/4.6/bits/stl_algo.h:5445:4: instantiated from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = int*, _Compare = int (*)(obstacol, obstacol)]’ user.cpp:30:24: instantiated from here /usr/include/c++/4.6/bits/stl_algo.h:116:9: error: could not convert ‘* __a’ from ‘int’ to ‘obstacol’ /usr/include/c++/4.6/bits/stl_algo.h:119:12: error: could not convert ‘* __a’ from ‘int’ to ‘obstacol’ /usr/include/c++/4.6/bits/stl_algo.h:121:12: error: could not convert ‘* __b’ from ‘int’ to ‘obstacol’ /usr/include/c++/4.6/bits/stl_algo.h: In function ‘_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, _Compare) [with _RandomAccessIterator = int*, _Tp = int, _Compare = int (*)(obstacol, obstacol)]’: /usr/include/c++/4.6/bits/stl_algo.h:2265:78: instantiated from ‘_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*, _Compare = int (*)(obstacol, obstacol)]’ /usr/include/c++/4.6/bits/stl_algo.h:2306:62: instantiated from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = int*, _Size = int, _Compare = int (*)(obstacol, obstacol)]’ /usr/include/c++/4.6/bits/stl_algo.h:5445:4: instantiated from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = int*, _Compare = int (*)(obstacol, obstacol)]’ user.cpp:30:24: instantiated from here /usr/include/c++/4.6/bits/stl_algo.h:2233:4: error: could not convert ‘* __first’ from ‘int’ to ‘obstacol’ /usr/include/c++/4.6/bits/stl_algo.h:2236:4: error: could not convert ‘__pivot’ from ‘const int’ to ‘obstacol’ /usr/include/c++/4.6/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*, _Compare = int (*)(obstacol, obstacol)]’: /usr/include/c++/4.6/bits/stl_algo.h:2137:6: instantiated from ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*, _Compare = int (*)(obstacol, obstacol)]’ /usr/include/c++/4.6/bits/stl_algo.h:2196:4: instantiated from ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*, _Compare = int (*)(obstacol, obstacol)]’ /usr/include/c++/4.6/bits/stl_algo.h:5447:4: instantiated from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = int*, _Compare = int (*)(obstacol, obstacol)]’ user.cpp:30:24: instantiated from here /usr/include/c++/4.6/bits/stl_algo.h:2087:7: error: could not convert ‘__val’ from ‘std::iterator_traits<int*>::value_type {aka int}’ to ‘obstacol’ In file included from /usr/include/c++/4.6/bits/stl_algo.h:63:0, from /usr/include/c++/4.6/algorithm:63, from user.cpp:2: /usr/include/c++/4.6/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = int*, _Distance = int, _Tp = int, _Compare = int (*)(obstacol, obstacol)]’: /usr/include/c++/4.6/bits/stl_heap.h:436:4: instantiated from ‘void std::make_heap(_RAIter, _RAIter, _Compare) [with _RAIter = int*, _Compare = int (*)(obstacol, obstacol)]’ /usr/include/c++/4.6/bits/stl_algo.h:1916:7: instantiated from ‘void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*, _Compare = int (*)(obstacol, obstacol)]’ /usr/include/c++/4.6/bits/stl_algo.h:5295:7: instantiated from ‘void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = int*, _Compare = int (*)(obstacol, obstacol)]’ /usr/include/c++/4.6/bits/stl_algo.h:2301:8: instantiated from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = int*, _Size = int, _Compare = int (*)(obstacol, obstacol)]’