Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #54530297
Rezumat problemă
#2802
Clasa
Se citește de la tastatură numărul n și un număr p cu valoarea 1 sau 2 și apoi n șiruri de tip nume prenume media1 media2 media3 separate prin spații.
Pentru p=1, se va afișa numărul elevilor care au media generală mai mare sau egală decât media clasei.
Pentru p=2, se va afișa pe primul rând media clasei și pe următoarele n rânduri, numele, prenumele și media generală a fiecărui elev, separate printr-un singur spațiu, sortat descrescător după medie; la medii egale se sortează crescător după nume, iar la nume egale crescător după prenume.
- Consola
-
Andrei Visalon (Prekzursil)
- Mirela Mlisan, Andrei Visalon
- medie
Detalii
| Problema | Clasa | Operații I/O |
 tastatură/ecran
|
|---|---|---|---|
| Limita timp | 0.01 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #54530297 | Utilizator |
Marcu Alexandru Novac (Marcu_Novac)
|
| Fișier | clasa.cpp | Dimensiune | 1.33 KB |
| Data încărcării | 01 Decembrie 2024, 18:50 | Scor / rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
clasa.cpp: In function 'int main()': clasa.cpp:40:57: error: parameter declared 'auto' sort(elevi.begin(), elevi.end(), [](const auto& a, const auto& b) { ^ clasa.cpp:40:72: error: parameter declared 'auto' sort(elevi.begin(), elevi.end(), [](const auto& a, const auto& b) { ^ clasa.cpp: In lambda function: clasa.cpp:41:17: error: 'a' was not declared in this scope if (a.second != b.second) { ^ clasa.cpp:41:29: error: 'b' was not declared in this scope if (a.second != b.second) { ^ clasa.cpp:44:17: error: 'a' was not declared in this scope if (a.first.first != b.first.first) { ^ clasa.cpp:44:34: error: 'b' was not declared in this scope if (a.first.first != b.first.first) { ^ clasa.cpp:47:20: error: 'a' was not declared in this scope return a.first.second < b.first.second; ^ clasa.cpp:47:37: error: 'b' was not declared in this scope return a.first.second < b.first.second; ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from clasa.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>*, std::vector<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double> > >; _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 = __gnu_cxx::__normal_iterator<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>*, std::vector<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double> > >; _Compare = main()::__lambda0]' /usr/include/c++/4.8/bits/stl_algo.h:5500:55: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>*, std::vector<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double> > >; _Compare = main()::__lambda0]' clasa.cpp:48:10: required from here /usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(main()::__lambda0) (std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>&, std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>&)' if (__comp(*__i, *__first)) ^ clasa.cpp:40:43: note: candidates are: sort(elevi.begin(), elevi.end(), [](const auto& a, const auto& b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from clasa.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2159:29: note: void (*)() <conversion> if (__comp(*__i, *__first)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2159:29: note: candidate expects 1 argument, 3 provided clasa.cpp:40:73: note: main()::__lambda0 sort(elevi.begin(), elevi.end(), [](const auto& a, const auto& b) { ^ clasa.cpp:40:73: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from clasa.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>*, std::vector<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double> > >; _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 = __gnu_cxx::__normal_iterator<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>*, std::vector<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double> > >; _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 = __gnu_cxx::__normal_iterator<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>*, std::vector<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double> > >; _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<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>*, std::vector<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double> > >; _Compare = main()::__lambda0]' clasa.cpp:48:10: required from here /usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(main()::__lambda0) (std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>&, std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>&)' if (__comp(*__i, *__first)) ^ clasa.cpp:40:43: note: candidates are: sort(elevi.begin(), elevi.end(), [](const auto& a, const auto& b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from clasa.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:1948:27: note: void (*)() <conversion> if (__comp(*__i, *__first)) ^ /usr/include/c++/4.8/bits/stl_algo.h:1948:27: note: candidate expects 1 argument, 3 provided clasa.cpp:40:73: note: main()::__lambda0 sort(elevi.begin(), elevi.end(), [](const auto& a, const auto& b) { ^ clasa.cpp:40:73: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from clasa.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 = __gnu_cxx::__normal_iterator<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>*, std::vector<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double> > >; _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 = __gnu_cxx::__normal_iterator<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>*, std::vector<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double> > >; _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<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>*, std::vector<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double> > >; _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<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>*, std::vector<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double> > >; _Compare = main()::__lambda0]' clasa.cpp:48:10: required from here /usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(main()::__lambda0) (std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>&, std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>&)' if (__comp(*__a, *__b)) ^ clasa.cpp:40:43: note: candidates are: sort(elevi.begin(), elevi.end(), [](const auto& a, const auto& b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from clasa.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:114:28: note: void (*)() <conversion> if (__comp(*__a, *__b)) ^ /usr/include/c++/4.8/bits/stl_algo.h:114:28: note: candidate expects 1 argument, 3 provided clasa.cpp:40:73: note: main()::__lambda0 sort(elevi.begin(), elevi.end(), [](const auto& a, const auto& b) { ^ clasa.cpp:40:73: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from clasa.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(main()::__lambda0) (std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>&, std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>&)' if (__comp(*__b, *__c)) ^ clasa.cpp:40:43: note: candidates are: sort(elevi.begin(), elevi.end(), [](const auto& a, const auto& b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from clasa.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:116:25: note: void (*)() <conversion> if (__comp(*__b, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:116:25: note: candidate expects 1 argument, 3 provided clasa.cpp:40:73: note: main()::__lambda0 sort(elevi.begin(), elevi.end(), [](const auto& a, const auto& b) { ^ clasa.cpp:40:73: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from clasa.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(main()::__lambda0) (std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>&, std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>&)' else if (__comp(*__a, *__c)) ^ clasa.cpp:40:43: note: candidates are: sort(elevi.begin(), elevi.end(), [](const auto& a, const auto& b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from clasa.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:118:30: note: void (*)() <conversion> else if (__comp(*__a, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:118:30: note: candidate expects 1 argument, 3 provided clasa.cpp:40:73: note: main()::__lambda0 sort(elevi.begin(), elevi.end(), [](const auto& a, const auto& b) { ^ clasa.cpp:40:73: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from clasa.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(main()::__lambda0) (std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>&, std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>&)' else if (__comp(*__a, *__c)) ^ clasa.cpp:40:43: note: candidates are: sort(elevi.begin(), elevi.end(), [](const auto& a, const auto& b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from clasa.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:123:33: note: void (*)() <conversion> else if (__comp(*__a, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:123:33: note: candidate expects 1 argument, 3 provided clasa.cpp:40:73: note: main()::__lambda0 sort(elevi.begin(), elevi.end(), [](const auto& a, const auto& b) { ^ clasa.cpp:40:73: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from clasa.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(main()::__lambda0) (std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>&, std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>&)' else if (__comp(*__b, *__c)) ^ clasa.cpp:40:43: note: candidates are: sort(elevi.begin(), elevi.end(), [](const auto& a, const auto& b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from clasa.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:125:33: note: void (*)() <conversion> else if (__comp(*__b, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:125:33: note: candidate expects 1 argument, 3 provided clasa.cpp:40:73: note: main()::__lambda0 sort(elevi.begin(), elevi.end(), [](const auto& a, const auto& b) { ^ clasa.cpp:40:73: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from clasa.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<std::pair<std::basic_string<char>, std::basic_string<char> >, double>*, std::vector<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double> > >; _Tp = std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>; _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<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>*, std::vector<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double> > >; _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<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>*, std::vector<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double> > >; _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<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>*, std::vector<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double> > >; _Compare = main()::__lambda0]' clasa.cpp:48:10: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda0) (std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>&, const std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>&)' while (__comp(*__first, __pivot)) ^ clasa.cpp:40:43: note: candidates are: sort(elevi.begin(), elevi.end(), [](const auto& a, const auto& b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from clasa.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: void (*)() <conversion> while (__comp(*__first, __pivot)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: candidate expects 1 argument, 3 provided clasa.cpp:40:73: note: main()::__lambda0 sort(elevi.begin(), elevi.end(), [](const auto& a, const auto& b) { ^ clasa.cpp:40:73: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from clasa.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda0) (const std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>&, std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>&)' while (__comp(__pivot, *__last)) ^ clasa.cpp:40:43: note: candidates are: sort(elevi.begin(), elevi.end(), [](const auto& a, const auto& b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from clasa.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: void (*)() <conversion> while (__comp(__pivot, *__last)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: candidate expects 1 argument, 3 provided clasa.cpp:40:73: note: main()::__lambda0 sort(elevi.begin(), elevi.end(), [](const auto& a, const auto& b) { ^ clasa.cpp:40:73: 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 clasa.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 = __gnu_cxx::__normal_iterator<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>*, std::vector<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double> > >; _Distance = int; _Tp = std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>; _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 = __gnu_cxx::__normal_iterator<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>*, std::vector<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double> > >; _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 = __gnu_cxx::__normal_iterator<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>*, std::vector<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double> > >; _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 = __gnu_cxx::__normal_iterator<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>*, std::vector<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double> > >; _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 = __gnu_cxx::__normal_iterator<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>*, std::vector<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double> > >; _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<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>*, std::vector<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double> > >; _Compare = main()::__lambda0]' clasa.cpp:48:10: required from here /usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(main()::__lambda0) (std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>&, std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>&)' *(__first + (__secondChild - 1)))) ^ clasa.cpp:40:43: note: candidates are: sort(elevi.begin(), elevi.end(), [](const auto& a, const auto& 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 clasa.cpp:3: /usr/include/c++/4.8/bits/stl_heap.h:313:40: note: void (*)() <conversion> *(__first + (__secondChild - 1)))) ^ /usr/include/c++/4.8/bits/stl_heap.h:313:40: note: candidate expects 1 argument, 3 provided clasa.cpp:40:73: note: main()::__lambda0 sort(elevi.begin(), elevi.end(), [](const auto& a, const auto& b) { ^ clasa.cpp:40:73: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from clasa.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h: At global scope: /usr/include/c++/4.8/bits/stl_algo.h:2110:5: error: 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>*, std::vector<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double> > >; _Compare = main()::__lambda0]', declared using local type 'main()::__lambda0', 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 clasa.cpp:3: /usr/include/c++/4.8/bits/stl_heap.h:331:5: error: 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>*, std::vector<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double> > >; _Compare = main()::__lambda0]', declared using local type 'main()::__lambda0', is used but never defined [-fpermissive] __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, ^ /usr/include/c++/4.8/bits/stl_heap.h:178:5: error: 'void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>*, std::vector<std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double> > >; _Distance = int; _Tp = std::pair<std::pair<std::basic_string<char>, std::basic_string<char> >, double>; _Compare = main()::__lambda0]', declared using local type 'main()::__lambda0', is used but never defined [-fpermissive] __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, ^
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 Clasa 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ă.