Rezumat problemă

Rucsac2

#2884

Într-un magazin intergalactic sunt n tipuri de obiecte, o infinitate din fiecare; pentru fiecare se cunoaște greutatea G și valoarea V. Un hoț intră în magazin având un rucsac ce poate transporta o greutate maximă GMax. El va fura anumite obiecte, astfel încât suma greutăților obiectelor furate să nu depășească GMax.

-

Consola Vintila Valentin (Wi) Din folclor medie

Clasa 11 Programare dinamică Probleme diverse de programare dinamică Problema rucsacului varianta discretă CNCV

Rezolvă

Detalii

Problema	Rucsac2	Operații I/O	tastatură/ecran
Limita timp	0.05 secunde	Limita memorie	Total: 1 MB / Stivă 1 MB
Id soluție	#63402801	Utilizator	Farkas Csanád (Farkas_Csanad)
Fișier	rucsac2.cpp	Dimensiune	916 B
Data încărcării	02 Martie 2026, 08:55	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

rucsac2.cpp: In function 'void feladat()':
rucsac2.cpp:26:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < rucs.size(); i++){

                                ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from rucsac2.cpp:3:
/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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Tp = std::pair<int, int>; _Compare = beolvas()::__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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = beolvas()::__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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Size = int; _Compare = beolvas()::__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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = beolvas()::__lambda0]'
rucsac2.cpp:20:3:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(beolvas()::__lambda0) (std::pair<int, int>&, const std::pair<int, int>&)'
    while (__comp(*__first, __pivot))
                                   ^
rucsac2.cpp:18:34: note: candidates are:
  sort(rucs.begin(), rucs.end(), [](pair<int, int>& a, pair<int, int>& b) {

                                  ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from rucsac2.cpp:3:
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: bool (*)(std::pair<int, int>&, std::pair<int, int>&) <conversion>
    while (__comp(*__first, __pivot))
                                   ^
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: note:   candidate expects 3 arguments, 3 provided
rucsac2.cpp:18:72: note: beolvas()::__lambda0
  sort(rucs.begin(), rucs.end(), [](pair<int, int>& a, pair<int, int>& b) {

                                                                        ^
rucsac2.cpp:18:72: note:   no known conversion for argument 2 from 'const std::pair<int, int>' to 'std::pair<int, int>&'
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from rucsac2.cpp:3:
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(beolvas()::__lambda0) (const std::pair<int, int>&, std::pair<int, int>&)'
    while (__comp(__pivot, *__last))
                                  ^
rucsac2.cpp:18:34: note: candidates are:
  sort(rucs.begin(), rucs.end(), [](pair<int, int>& a, pair<int, int>& b) {

                                  ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from rucsac2.cpp:3:
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: bool (*)(std::pair<int, int>&, std::pair<int, int>&) <conversion>
    while (__comp(__pivot, *__last))
                                  ^
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: note:   candidate expects 3 arguments, 3 provided
rucsac2.cpp:18:72: note: beolvas()::__lambda0
  sort(rucs.begin(), rucs.end(), [](pair<int, int>& a, pair<int, int>& b) {

                                                                        ^
rucsac2.cpp:18:72: note:   no known conversion for argument 1 from 'const std::pair<int, int>' to 'std::pair<int, int>&'

Cum funcționează evaluarea?