Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #42370288
Rezumat problemă
#4010
MosCraciun2
Moș Crăciun pregătește cadourile pentru acest an. El trebuie să dea cadouri identice la n copii. Pentru aceasta, a vizitat m magazine (posibil online) și pentru fiecare magazin a aflat prețul cadoului în acel magazin și numărul de cadouri disponibile în acel magazin.
Determinati suma minimă necesară pentru a cumpăra cele n cadouri. Dacă nu se pot cumpăra cele n cadouri afișați mesajul imposibil.
- Consola
-
Candale Silviu (silviu)
- Silviu Candale
- ușoară
Detalii
| Problema | MosCraciun2 | Operații I/O |
 tastatură/ecran
|
|---|---|---|---|
| Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #42370288 | Utilizator |
Bantas Serban (cyg_bserban)
|
| Fișier | moscraciun2.cpp | Dimensiune | 1.16 KB |
| Data încărcării | 02 Martie 2023, 22:00 | Scor / rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
moscraciun2.cpp: In function 'int main()': moscraciun2.cpp:23:44: error: parameter declared 'auto' sort(cadou+1,cadou+n+1,[](const auto & a, const auto & b) -> bool ^ moscraciun2.cpp:23:60: error: parameter declared 'auto' sort(cadou+1,cadou+n+1,[](const auto & a, const auto & b) -> bool ^ moscraciun2.cpp: In lambda function: moscraciun2.cpp:25:16: error: 'a' was not declared in this scope return a.cost < b.cost; ^ moscraciun2.cpp:25:25: error: 'b' was not declared in this scope return a.cost < b.cost; ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from moscraciun2.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = <anonymous struct>*; _Compare = main()::__lambda0]': /usr/include/c++/4.8/bits/stl_algo.h:2226:70: required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = <anonymous struct>*; _Compare = main()::__lambda0]' /usr/include/c++/4.8/bits/stl_algo.h:5500:55: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = <anonymous struct>*; _Compare = main()::__lambda0]' moscraciun2.cpp:26:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(main()::__lambda0) (<anonymous struct>&, <anonymous struct>&)' if (__comp(*__i, *__first)) ^ moscraciun2.cpp:23:29: note: candidates are: sort(cadou+1,cadou+n+1,[](const auto & a, const auto & b) -> bool ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from moscraciun2.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2159:29: note: bool (*)() <conversion> if (__comp(*__i, *__first)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2159:29: note: candidate expects 1 argument, 3 provided moscraciun2.cpp:23:66: note: main()::__lambda0 sort(cadou+1,cadou+n+1,[](const auto & a, const auto & b) -> bool ^ moscraciun2.cpp:23:66: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from moscraciun2.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = <anonymous struct>*; _Compare = main()::__lambda0]': /usr/include/c++/4.8/bits/stl_algo.h:5349:59: required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = <anonymous struct>*; _Compare = main()::__lambda0]' /usr/include/c++/4.8/bits/stl_algo.h:2332:68: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = <anonymous struct>*; _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 = <anonymous struct>*; _Compare = main()::__lambda0]' moscraciun2.cpp:26:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(main()::__lambda0) (<anonymous struct>&, <anonymous struct>&)' if (__comp(*__i, *__first)) ^ moscraciun2.cpp:23:29: note: candidates are: sort(cadou+1,cadou+n+1,[](const auto & a, const auto & b) -> bool ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from moscraciun2.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:1948:27: note: bool (*)() <conversion> if (__comp(*__i, *__first)) ^ /usr/include/c++/4.8/bits/stl_algo.h:1948:27: note: candidate expects 1 argument, 3 provided moscraciun2.cpp:23:66: note: main()::__lambda0 sort(cadou+1,cadou+n+1,[](const auto & a, const auto & b) -> bool ^ moscraciun2.cpp:23:66: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from moscraciun2.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = <anonymous struct>*; _Compare = main()::__lambda0]': /usr/include/c++/4.8/bits/stl_algo.h:2295:13: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = <anonymous struct>*; _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 = <anonymous struct>*; _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 = <anonymous struct>*; _Compare = main()::__lambda0]' moscraciun2.cpp:26:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(main()::__lambda0) (<anonymous struct>&, <anonymous struct>&)' if (__comp(*__a, *__b)) ^ moscraciun2.cpp:23:29: note: candidates are: sort(cadou+1,cadou+n+1,[](const auto & a, const auto & b) -> bool ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from moscraciun2.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:114:28: note: bool (*)() <conversion> if (__comp(*__a, *__b)) ^ /usr/include/c++/4.8/bits/stl_algo.h:114:28: note: candidate expects 1 argument, 3 provided moscraciun2.cpp:23:66: note: main()::__lambda0 sort(cadou+1,cadou+n+1,[](const auto & a, const auto & b) -> bool ^ moscraciun2.cpp:23:66: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from moscraciun2.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(main()::__lambda0) (<anonymous struct>&, <anonymous struct>&)' if (__comp(*__b, *__c)) ^ moscraciun2.cpp:23:29: note: candidates are: sort(cadou+1,cadou+n+1,[](const auto & a, const auto & b) -> bool ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from moscraciun2.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:116:25: note: bool (*)() <conversion> if (__comp(*__b, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:116:25: note: candidate expects 1 argument, 3 provided moscraciun2.cpp:23:66: note: main()::__lambda0 sort(cadou+1,cadou+n+1,[](const auto & a, const auto & b) -> bool ^ moscraciun2.cpp:23:66: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from moscraciun2.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(main()::__lambda0) (<anonymous struct>&, <anonymous struct>&)' else if (__comp(*__a, *__c)) ^ moscraciun2.cpp:23:29: note: candidates are: sort(cadou+1,cadou+n+1,[](const auto & a, const auto & b) -> bool ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from moscraciun2.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:118:30: note: bool (*)() <conversion> else if (__comp(*__a, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:118:30: note: candidate expects 1 argument, 3 provided moscraciun2.cpp:23:66: note: main()::__lambda0 sort(cadou+1,cadou+n+1,[](const auto & a, const auto & b) -> bool ^ moscraciun2.cpp:23:66: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from moscraciun2.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(main()::__lambda0) (<anonymous struct>&, <anonymous struct>&)' else if (__comp(*__a, *__c)) ^ moscraciun2.cpp:23:29: note: candidates are: sort(cadou+1,cadou+n+1,[](const auto & a, const auto & b) -> bool ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from moscraciun2.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:123:33: note: bool (*)() <conversion> else if (__comp(*__a, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:123:33: note: candidate expects 1 argument, 3 provided moscraciun2.cpp:23:66: note: main()::__lambda0 sort(cadou+1,cadou+n+1,[](const auto & a, const auto & b) -> bool ^ moscraciun2.cpp:23:66: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from moscraciun2.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(main()::__lambda0) (<anonymous struct>&, <anonymous struct>&)' else if (__comp(*__b, *__c)) ^ moscraciun2.cpp:23:29: note: candidates are: sort(cadou+1,cadou+n+1,[](const auto & a, const auto & b) -> bool ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from moscraciun2.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:125:33: note: bool (*)() <conversion> else if (__comp(*__b, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:125:33: note: candidate expects 1 argument, 3 provided moscraciun2.cpp:23:66: note: main()::__lambda0 sort(cadou+1,cadou+n+1,[](const auto & a, const auto & b) -> bool ^ moscraciun2.cpp:23:66: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from moscraciun2.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 = <anonymous struct>*; _Tp = <anonymous struct>; _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 = <anonymous struct>*; _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 = <anonymous struct>*; _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 = <anonymous struct>*; _Compare = main()::__lambda0]' moscraciun2.cpp:26:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda0) (<anonymous struct>&, const<anonymous struct>&)' while (__comp(*__first, __pivot)) ^ moscraciun2.cpp:23:29: note: candidates are: sort(cadou+1,cadou+n+1,[](const auto & a, const auto & b) -> bool ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from moscraciun2.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: bool (*)() <conversion> while (__comp(*__first, __pivot)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: candidate expects 1 argument, 3 provided moscraciun2.cpp:23:66: note: main()::__lambda0 sort(cadou+1,cadou+n+1,[](const auto & a, const auto & b) -> bool ^ moscraciun2.cpp:23:66: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from moscraciun2.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda0) (const<anonymous struct>&, <anonymous struct>&)' while (__comp(__pivot, *__last)) ^ moscraciun2.cpp:23:29: note: candidates are: sort(cadou+1,cadou+n+1,[](const auto & a, const auto & b) -> bool ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from moscraciun2.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: bool (*)() <conversion> while (__comp(__pivot, *__last)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: candidate expects 1 argument, 3 provided moscraciun2.cpp:23:66: note: main()::__lambda0 sort(cadou+1,cadou+n+1,[](const auto & a, const auto & b) -> bool ^ moscraciun2.cpp:23:66: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from moscraciun2.cpp:3: /usr/include/c++/4.8/bits/stl_heap.h: In instantiation of 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = <anonymous struct>*; _Distance = int; _Tp = <anonymous struct>; _Compare = main()::__lambda0]': /usr/include/c++/4.8/bits/stl_heap.h:448:15: required from 'void std::make_heap(_RAIter, _RAIter, _Compare) [with _RAIter = <anonymous struct>*; _Compare = main()::__lambda0]' /usr/include/c++/4.8/bits/stl_algo.h:1946:47: required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = <anonymous struct>*; _Compare = main()::__lambda0]' /usr/include/c++/4.8/bits/stl_algo.h:5349:59: required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = <anonymous struct>*; _Compare = main()::__lambda0]' /usr/include/c++/4.8/bits/stl_algo.h:2332:68: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = <anonymous struct>*; _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 = <anonymous struct>*; _Compare = main()::__lambda0]' moscraciun2.cpp:26:6: required from here /usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(main()::__lambda0) (<anonymous struct>&, <anonymous struct>&)' *(__first + (__secondChild - 1)))) ^ moscraciun2.cpp:23:29: note: candidates are: sort(cadou+1,cadou+n+1,[](const auto & a, const auto & b) -> bool ^ In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from moscraciun2.cpp:3: /usr/include/c++/4.8/bits/stl_heap.h:313:40: note: bool (*)() <conversion> *(__first + (__secondChild - 1)))) ^ /usr/include/c++/4.8/bits/stl_heap.h:313:40: note: candidate expects 1 argument, 3 provided moscraciun2.cpp:23:66: note: main()::__lambda0 sort(cadou+1,cadou+n+1,[](const auto & a, const auto & b) -> bool ^ moscraciun2.cpp:23:66: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/vector:60:0, from moscraciun2.cpp:2: /usr/include/c++/4.8/bits/stl_algobase.h: At global scope: /usr/include/c++/4.8/bits/stl_algobase.h:655:5: error: '_BI2 std::move_backward(_BI1, _BI1, _BI2) [with _BI1 = <anonymous struct>*; _BI2 = <anonymous struct>*]', declared using anonymous type, is used but never defined [-fpermissive] move_backward(_BI1 __first, _BI1 __last, _BI2 __result) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from moscraciun2.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2110:5: error: 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = <anonymous struct>*; _Compare = main()::__lambda0]', declared using anonymous type, is used but never defined [-fpermissive] __unguarded_linear_insert(_RandomAccessIterator __last, ^ In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from moscraciun2.cpp:3: /usr/include/c++/4.8/bits/stl_heap.h:331:5: error: 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = <anonymous struct>*; _Compare = main()::__lambda0]', declared using anonymous type, is used but never defined [-fpermissive] __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, ^ In file included from /usr/include/c++/4.8/vector:60:0, from moscraciun2.cpp:2: /usr/include/c++/4.8/bits/stl_algobase.h:119:5: error: 'void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = <anonymous struct>*; _ForwardIterator2 = <anonymous struct>*]', declared using anonymous type, is used but never defined [-fpermissive] iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b) ^ In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from moscraciun2.cpp:3: /usr/include/c++/4.8/bits/stl_heap.h:178:5: error: 'void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = <anonymous struct>*; _Distance = int; _Tp = <anonymous struct>; _Compare = main()::__lambda0]', declared using anonymous type, is used but never defined [-fpermissive] __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, ^ moscraciun2.cpp: In function 'int main()': moscraciun2.cpp:20:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d",&nr,&n); ^ moscraciun2.cpp:22:54: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d",&cadou[i].cost, &cadou[i].cant); ^
Cum funcționează evaluarea?
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
- probleme la care rezolvarea presupune scrierea unui program complet
- probleme la care rezolvarea presupune scrierea unei secvențe de program - câteva instrucțiuni, o listă de declarații, una sau mai multe funcții, etc.
Problema MosCraciun2 face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
- Programul sursă este compilat folosind compilatorul corespunzător. Dacă în urma compilării se obțin erori sau avertismente, acestea sunt afișate în această pagină.
- Dacă programul a fost compilat, executabilul obținut va fi rulat, furnizându-i-se unul sau mai multe seturi de date de intrare, în concordanță cu restricțiile specifice problemei. Pentru fiecare set de date se obține un anumit punctaj, în raport cu corectitudinea soluției tale.
Suma punctajelor acordate pe testele utilizate pentru verificare este 100. Astfel, soluția ta poate obține cel mult 100 de puncte, caz în care se poate considera corectă.