Rezumat problemă

serbare

#1460

La o serbare sunt n grupe de copii care poartă p tipuri de uniforme. Scrieţi un program care să afişeze pe ecran tipurile de uniforme în ordinea descrescătoare a numărului total de copii ce poartă fiecare tip de uniformă. Afişarea se va face pe o singură linie, valoriile fiind separate printr-un spaţiu.

Variante Bacalaureat 2007

Fișiere Antal Alexandru (Courage) ușoară

Clasa 10 Structuri de date neomogene Probleme diverse

Rezolvă

Detalii

Problema	serbare	Operații I/O	serbare.in/serbare.out
Limita timp	0.1 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#61960954	Utilizator	Horhat Sotiris (horhatsotiris)
Fișier	serbare.cpp	Dimensiune	658 B
Data încărcării	19 Decembrie 2025, 16:21	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

serbare.cpp: In lambda function:
serbare.cpp:24:15: error: request for member 'first' in 'a', which is of non-class type 'int'
         if (a.first != b.first) return a.first 

               ^
serbare.cpp:24:26: error: request for member 'first' in 'b', which is of non-class type 'int'
         if (a.first != b.first) return a.first 

                          ^
serbare.cpp:24:42: error: request for member 'first' in 'a', which is of non-class type 'int'
         if (a.first != b.first) return a.first 

                                          ^
serbare.cpp:25:9: error: expected ';' before 'return'
         return a.second < b.second; 

         ^
serbare.cpp:25:18: error: request for member 'second' in 'a', which is of non-class type 'int'
         return a.second < b.second; 

                  ^
serbare.cpp:25:29: error: request for member 'second' in 'b', which is of non-class type 'int'
         return a.second < b.second; 

                             ^
serbare.cpp: In function 'int main()':
serbare.cpp:28:19: error: invalid initialization of reference of type 'int&' from expression of type 'std::pair<int, int>'
     for (int &x : v) {

                   ^
serbare.cpp:29:19: error: request for member 'second' in 'x', which is of non-class type 'int'
         cout << x.second << " ";

                   ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from serbare.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<int, int>*, std::vector<std::pair<int, int> > >; _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<int, int>*, std::vector<std::pair<int, int> > >; _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<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]'
serbare.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) (std::pair<int, int>&, std::pair<int, int>&)'
    if (__comp(*__i, *__first))
                             ^
serbare.cpp:23:31: note: candidates are:
     sort(v.begin(), v.end(), [](int &a, int &b){

                               ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from serbare.cpp:3:
/usr/include/c++/4.8/bits/stl_algo.h:2159:29: note: void (*)(int&, int&) <conversion>
    if (__comp(*__i, *__first))
                             ^
/usr/include/c++/4.8/bits/stl_algo.h:2159:29: note:   candidate expects 3 arguments, 3 provided
serbare.cpp:23:47: note: main()::__lambda0
     sort(v.begin(), v.end(), [](int &a, int &b){

                                               ^
serbare.cpp:23:47: note:   no known conversion for argument 1 from 'std::pair<int, int>' to 'int&'
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from serbare.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<int, int>*, std::vector<std::pair<int, int> > >; _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<int, int>*, std::vector<std::pair<int, int> > >; _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<int, int>*, std::vector<std::pair<int, 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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]'
serbare.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) (std::pair<int, int>&, std::pair<int, int>&)'
  if (__comp(*__i, *__first))
                           ^
serbare.cpp:23:31: note: candidates are:
     sort(v.begin(), v.end(), [](int &a, int &b){

                               ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from serbare.cpp:3:
/usr/include/c++/4.8/bits/stl_algo.h:1948:27: note: void (*)(int&, int&) <conversion>
  if (__comp(*__i, *__first))
                           ^
/usr/include/c++/4.8/bits/stl_algo.h:1948:27: note:   candidate expects 3 arguments, 3 provided
serbare.cpp:23:47: note: main()::__lambda0
     sort(v.begin(), v.end(), [](int &a, int &b){

                                               ^
serbare.cpp:23:47: note:   no known conversion for argument 1 from 'std::pair<int, int>' to 'int&'
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from serbare.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<int, int>*, std::vector<std::pair<int, int> > >; _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<int, int>*, std::vector<std::pair<int, 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<std::pair<int, int>*, std::vector<std::pair<int, 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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]'
serbare.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) (std::pair<int, int>&, std::pair<int, int>&)'
       if (__comp(*__a, *__b))
                            ^
serbare.cpp:23:31: note: candidates are:
     sort(v.begin(), v.end(), [](int &a, int &b){

                               ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from serbare.cpp:3:
/usr/include/c++/4.8/bits/stl_algo.h:114:28: note: void (*)(int&, int&) <conversion>
       if (__comp(*__a, *__b))
                            ^
/usr/include/c++/4.8/bits/stl_algo.h:114:28: note:   candidate expects 3 arguments, 3 provided
serbare.cpp:23:47: note: main()::__lambda0
     sort(v.begin(), v.end(), [](int &a, int &b){

                                               ^
serbare.cpp:23:47: note:   no known conversion for argument 1 from 'std::pair<int, int>' to 'int&'
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from serbare.cpp:3:
/usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(main()::__lambda0) (std::pair<int, int>&, std::pair<int, int>&)'
    if (__comp(*__b, *__c))
                         ^
serbare.cpp:23:31: note: candidates are:
     sort(v.begin(), v.end(), [](int &a, int &b){

                               ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from serbare.cpp:3:
/usr/include/c++/4.8/bits/stl_algo.h:116:25: note: void (*)(int&, int&) <conversion>
    if (__comp(*__b, *__c))
                         ^
/usr/include/c++/4.8/bits/stl_algo.h:116:25: note:   candidate expects 3 arguments, 3 provided
serbare.cpp:23:47: note: main()::__lambda0
     sort(v.begin(), v.end(), [](int &a, int &b){

                                               ^
serbare.cpp:23:47: note:   no known conversion for argument 1 from 'std::pair<int, int>' to 'int&'
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from serbare.cpp:3:
/usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(main()::__lambda0) (std::pair<int, int>&, std::pair<int, int>&)'
    else if (__comp(*__a, *__c))
                              ^
serbare.cpp:23:31: note: candidates are:
     sort(v.begin(), v.end(), [](int &a, int &b){

                               ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from serbare.cpp:3:
/usr/include/c++/4.8/bits/stl_algo.h:118:30: note: void (*)(int&, int&) <conversion>
    else if (__comp(*__a, *__c))
                              ^
/usr/include/c++/4.8/bits/stl_algo.h:118:30: note:   candidate expects 3 arguments, 3 provided
serbare.cpp:23:47: note: main()::__lambda0
     sort(v.begin(), v.end(), [](int &a, int &b){

                                               ^
serbare.cpp:23:47: note:   no known conversion for argument 1 from 'std::pair<int, int>' to 'int&'
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from serbare.cpp:3:
/usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(main()::__lambda0) (std::pair<int, int>&, std::pair<int, int>&)'
       else if (__comp(*__a, *__c))
                                 ^
serbare.cpp:23:31: note: candidates are:
     sort(v.begin(), v.end(), [](int &a, int &b){

                               ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from serbare.cpp:3:
/usr/include/c++/4.8/bits/stl_algo.h:123:33: note: void (*)(int&, int&) <conversion>
       else if (__comp(*__a, *__c))
                                 ^
/usr/include/c++/4.8/bits/stl_algo.h:123:33: note:   candidate expects 3 arguments, 3 provided
serbare.cpp:23:47: note: main()::__lambda0
     sort(v.begin(), v.end(), [](int &a, int &b){

                                               ^
serbare.cpp:23:47: note:   no known conversion for argument 1 from 'std::pair<int, int>' to 'int&'
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from serbare.cpp:3:
/usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(main()::__lambda0) (std::pair<int, int>&, std::pair<int, int>&)'
       else if (__comp(*__b, *__c))
                                 ^
serbare.cpp:23:31: note: candidates are:
     sort(v.begin(), v.end(), [](int &a, int &b){

                               ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from serbare.cpp:3:
/usr/include/c++/4.8/bits/stl_algo.h:125:33: note: void (*)(int&, int&) <conversion>
       else if (__comp(*__b, *__c))
                                 ^
/usr/include/c++/4.8/bits/stl_algo.h:125:33: note:   candidate expects 3 arguments, 3 provided
serbare.cpp:23:47: note: main()::__lambda0
     sort(v.begin(), v.end(), [](int &a, int &b){

                                               ^
serbare.cpp:23:47: note:   no known conversion for argument 1 from 'std::pair<int, int>' to 'int&'
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from serbare.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 = 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<int, int>*, std::vector<std::pair<int, 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<std::pair<int, int>*, std::vector<std::pair<int, 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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]'
serbare.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) (std::pair<int, int>&, const std::pair<int, int>&)'
    while (__comp(*__first, __pivot))
                                   ^
serbare.cpp:23:31: note: candidates are:
     sort(v.begin(), v.end(), [](int &a, int &b){

                               ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from serbare.cpp:3:
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: void (*)(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
serbare.cpp:23:47: note: main()::__lambda0
     sort(v.begin(), v.end(), [](int &a, int &b){

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

                               ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from serbare.cpp:3:
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: void (*)(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
serbare.cpp:23:47: note: main()::__lambda0
     sort(v.begin(), v.end(), [](int &a, int &b){

                                               ^
serbare.cpp:23:47: note:   no known conversion for argument 1 from 'const std::pair<int, int>' to 'int&'
In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0,
                 from /usr/include/c++/4.8/algorithm:62,
                 from serbare.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<int, int>*, std::vector<std::pair<int, int> > >; _Distance = int; _Tp = std::pair<int, int>; _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<int, int>*, std::vector<std::pair<int, int> > >; _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<int, int>*, std::vector<std::pair<int, int> > >; _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<int, int>*, std::vector<std::pair<int, int> > >; _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<int, int>*, std::vector<std::pair<int, 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<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]'
serbare.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) (std::pair<int, int>&, std::pair<int, int>&)'
        *(__first + (__secondChild - 1))))
                                        ^
serbare.cpp:23:31: note: candidates are:
     sort(v.begin(), v.end(), [](int &a, int &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 serbare.cpp:3:
/usr/include/c++/4.8/bits/stl_heap.h:313:40: note: void (*)(int&, int&) <conversion>
        *(__first + (__secondChild - 1))))
                                        ^
/usr/include/c++/4.8/bits/stl_heap.h:313:40: note:   candidate expects 3 arguments, 3 provided
serbare.cpp:23:47: note: main()::__lambda0
     sort(v.begin(), v.end(), [](int &a, int &b){

                                               ^
serbare.cpp:23:47: note:   no known conversion for argument 1 from 'std::pair<int, int>' to 'int&'
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from serbare.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<int, int>*, std::vector<std::pair<int, int> > >; _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 serbare.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<int, int>*, std::vector<std::pair<int, int> > >; _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<int, int>*, std::vector<std::pair<int, int> > >; _Distance = int; _Tp = std::pair<int, int>; _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?