Rezumat problemă

5numere

#559

Se dau 5 numere distincte. Să se determine suma celor mai mari 3 dintre ele.

Consola Marius Nicoli (mariusn) medie

Clasa 9 Elemente de baza ale limbajului Structura de decizie

Rezolvă

Detalii

Problema	5numere	Operații I/O	tastatură/ecran
Limita timp	0.1 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#64043163	Utilizator	Banica Albert (teleghidat)
Fișier	numere.cpp	Dimensiune	346 B
Data încărcării	11 Aprilie 2026, 22:16	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from numere.cpp:4:
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of '_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<short int*, std::vector<short int> >; _Tp = short int; _Compare = main()::__lambda0]':
/usr/include/c++/4.8/bits/stl_algo.h:2296:78:   required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<short int*, std::vector<short int> >; _Compare = main()::__lambda0]'
/usr/include/c++/4.8/bits/stl_algo.h:2337:62:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<short int*, std::vector<short int> >; _Size = int; _Compare = main()::__lambda0]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<short int*, std::vector<short int> >; _Compare = main()::__lambda0]'
numere.cpp:11:68:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda0) (short int&, const short int&)'
    while (__comp(*__first, __pivot))
                                   ^
numere.cpp:11:28: note: candidates are:
  sort(a.begin(), a.end(), [](int16_t &x, int16_t &y){return x < y;});

                            ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from numere.cpp:4:
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: bool (*)(int16_t&, int16_t&) {aka bool (*)(short int&, short int&)} <conversion>
    while (__comp(*__first, __pivot))
                                   ^
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: note:   candidate expects 3 arguments, 3 provided
numere.cpp:11:52: note: main()::__lambda0
  sort(a.begin(), a.end(), [](int16_t &x, int16_t &y){return x < y;});

                                                    ^
numere.cpp:11:52: note:   no known conversion for argument 2 from 'const short int' to 'int16_t& {aka short int&}'
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from numere.cpp:4:
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda0) (const short int&, short int&)'
    while (__comp(__pivot, *__last))
                                  ^
numere.cpp:11:28: note: candidates are:
  sort(a.begin(), a.end(), [](int16_t &x, int16_t &y){return x < y;});

                            ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from numere.cpp:4:
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: bool (*)(int16_t&, int16_t&) {aka bool (*)(short int&, short int&)} <conversion>
    while (__comp(__pivot, *__last))
                                  ^
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: note:   candidate expects 3 arguments, 3 provided
numere.cpp:11:52: note: main()::__lambda0
  sort(a.begin(), a.end(), [](int16_t &x, int16_t &y){return x < y;});

                                                    ^
numere.cpp:11:52: note:   no known conversion for argument 1 from 'const short int' to 'int16_t& {aka short int&}'

Cum funcționează evaluarea?