Detalii evaluare #54932653

Rezumat problemă

La ora de educație fizică participă n elevi, numerotați de la 1 la n, băieți și fete, pentru fiecare dintre ei cunoscându-se înălțimea, exprimată în centimetri. Profesorul le cere să se alinieze, mai întâi băieții, în ordine descrescătoare a înălțimii, apoi fetele, de asemenea în ordine descrescătoare.

Afișați numerele de ordine ale elevilor în ordinea dorită de profesor. Dacă doi băieți (sau fete) au aceeași înălțime, se va afișa mai întâi elevul cu numărul de ordine mai mic.

Detalii

Problema Aliniere Operații I/O tastatură/ecran
Limita timp 0.1 secunde Limita memorie Total: 64 MB / Stivă 8 MB
Id soluție #54932653 Utilizator Batis Andrei (batas)
Fișier aliniere.cpp Dimensiune 1.44 KB
Data încărcării 12 Decembrie 2024, 17:02 Scor / rezultat Eroare de compilare

Evaluare


Mesaj compilare

In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from aliniere.cpp:2:
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::pair<int, std::pair<int, char> >*; _Compare = std::greater<int>]':
/usr/include/c++/4.8/bits/stl_algo.h:2226:70:   required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::pair<int, std::pair<int, char> >*; _Compare = std::greater<int>]'
/usr/include/c++/4.8/bits/stl_algo.h:5500:55:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = std::pair<int, std::pair<int, char> >*; _Compare = std::greater<int>]'
aliniere.cpp:25:42:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(std::greater<int>) (std::pair<int, std::pair<int, char> >&, std::pair<int, std::pair<int, char> >&)'
    if (__comp(*__i, *__first))
                             ^
In file included from /usr/include/c++/4.8/string:48:0,
                 from /usr/include/c++/4.8/bits/locale_classes.h:40,
                 from /usr/include/c++/4.8/bits/ios_base.h:41,
                 from /usr/include/c++/4.8/ios:42,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from aliniere.cpp:1:
/usr/include/c++/4.8/bits/stl_function.h:222:12: note: candidate is:
     struct greater : public binary_function<_Tp, _Tp, bool>
            ^
/usr/include/c++/4.8/bits/stl_function.h:225:7: note: bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int]
       operator()(const _Tp& __x, const _Tp& __y) const
       ^
/usr/include/c++/4.8/bits/stl_function.h:225:7: note:   no known conversion for argument 1 from 'std::pair<int, std::pair<int, char> >' to 'const int&'
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from aliniere.cpp:2:
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::pair<int, std::pair<int, char> >*; _Compare = std::greater<int>]':
/usr/include/c++/4.8/bits/stl_algo.h:5349:59:   required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = std::pair<int, std::pair<int, char> >*; _Compare = std::greater<int>]'
/usr/include/c++/4.8/bits/stl_algo.h:2332:68:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = std::pair<int, std::pair<int, char> >*; _Size = int; _Compare = std::greater<int>]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = std::pair<int, std::pair<int, char> >*; _Compare = std::greater<int>]'
aliniere.cpp:25:42:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(std::greater<int>) (std::pair<int, std::pair<int, char> >&, std::pair<int, std::pair<int, char> >&)'
  if (__comp(*__i, *__first))
                           ^
In file included from /usr/include/c++/4.8/string:48:0,
                 from /usr/include/c++/4.8/bits/locale_classes.h:40,
                 from /usr/include/c++/4.8/bits/ios_base.h:41,
                 from /usr/include/c++/4.8/ios:42,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from aliniere.cpp:1:
/usr/include/c++/4.8/bits/stl_function.h:222:12: note: candidate is:
     struct greater : public binary_function<_Tp, _Tp, bool>
            ^
/usr/include/c++/4.8/bits/stl_function.h:225:7: note: bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int]
       operator()(const _Tp& __x, const _Tp& __y) const
       ^
/usr/include/c++/4.8/bits/stl_function.h:225:7: note:   no known conversion for argument 1 from 'std::pair<int, std::pair<int, char> >' to 'const int&'
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from aliniere.cpp:2:
/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 = std::pair<int, std::pair<int, char> >*; _Compare = std::greater<int>]':
/usr/include/c++/4.8/bits/stl_algo.h:2295:13:   required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::pair<int, std::pair<int, char> >*; _Compare = std::greater<int>]'
/usr/include/c++/4.8/bits/stl_algo.h:2337:62:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = std::pair<int, std::pair<int, char> >*; _Size = int; _Compare = std::greater<int>]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = std::pair<int, std::pair<int, char> >*; _Compare = std::greater<int>]'
aliniere.cpp:25:42:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(std::greater<int>) (std::pair<int, std::pair<int, char> >&, std::pair<int, std::pair<int, char> >&)'
       if (__comp(*__a, *__b))
                            ^
In file included from /usr/include/c++/4.8/string:48:0,
                 from /usr/include/c++/4.8/bits/locale_classes.h:40,
                 from /usr/include/c++/4.8/bits/ios_base.h:41,
                 from /usr/include/c++/4.8/ios:42,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from aliniere.cpp:1:
/usr/include/c++/4.8/bits/stl_function.h:222:12: note: candidate is:
     struct greater : public binary_function<_Tp, _Tp, bool>
            ^
/usr/include/c++/4.8/bits/stl_function.h:225:7: note: bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int]
       operator()(const _Tp& __x, const _Tp& __y) const
       ^
/usr/include/c++/4.8/bits/stl_function.h:225:7: note:   no known conversion for argument 1 from 'std::pair<int, std::pair<int, char> >' to 'const int&'
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from aliniere.cpp:2:
/usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(std::greater<int>) (std::pair<int, std::pair<int, char> >&, std::pair<int, std::pair<int, char> >&)'
    if (__comp(*__b, *__c))
                         ^
In file included from /usr/include/c++/4.8/string:48:0,
                 from /usr/include/c++/4.8/bits/locale_classes.h:40,
                 from /usr/include/c++/4.8/bits/ios_base.h:41,
                 from /usr/include/c++/4.8/ios:42,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from aliniere.cpp:1:
/usr/include/c++/4.8/bits/stl_function.h:222:12: note: candidate is:
     struct greater : public binary_function<_Tp, _Tp, bool>
            ^
/usr/include/c++/4.8/bits/stl_function.h:225:7: note: bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int]
       operator()(const _Tp& __x, const _Tp& __y) const
       ^
/usr/include/c++/4.8/bits/stl_function.h:225:7: note:   no known conversion for argument 1 from 'std::pair<int, std::pair<int, char> >' to 'const int&'
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from aliniere.cpp:2:
/usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(std::greater<int>) (std::pair<int, std::pair<int, char> >&, std::pair<int, std::pair<int, char> >&)'
    else if (__comp(*__a, *__c))
                              ^
In file included from /usr/include/c++/4.8/string:48:0,
                 from /usr/include/c++/4.8/bits/locale_classes.h:40,
                 from /usr/include/c++/4.8/bits/ios_base.h:41,
                 from /usr/include/c++/4.8/ios:42,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from aliniere.cpp:1:
/usr/include/c++/4.8/bits/stl_function.h:222:12: note: candidate is:
     struct greater : public binary_function<_Tp, _Tp, bool>
            ^
/usr/include/c++/4.8/bits/stl_function.h:225:7: note: bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int]
       operator()(const _Tp& __x, const _Tp& __y) const
       ^
/usr/include/c++/4.8/bits/stl_function.h:225:7: note:   no known conversion for argument 1 from 'std::pair<int, std::pair<int, char> >' to 'const int&'
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from aliniere.cpp:2:
/usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(std::greater<int>) (std::pair<int, std::pair<int, char> >&, std::pair<int, std::pair<int, char> >&)'
       else if (__comp(*__a, *__c))
                                 ^
In file included from /usr/include/c++/4.8/string:48:0,
                 from /usr/include/c++/4.8/bits/locale_classes.h:40,
                 from /usr/include/c++/4.8/bits/ios_base.h:41,
                 from /usr/include/c++/4.8/ios:42,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from aliniere.cpp:1:
/usr/include/c++/4.8/bits/stl_function.h:222:12: note: candidate is:
     struct greater : public binary_function<_Tp, _Tp, bool>
            ^
/usr/include/c++/4.8/bits/stl_function.h:225:7: note: bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int]
       operator()(const _Tp& __x, const _Tp& __y) const
       ^
/usr/include/c++/4.8/bits/stl_function.h:225:7: note:   no known conversion for argument 1 from 'std::pair<int, std::pair<int, char> >' to 'const int&'
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from aliniere.cpp:2:
/usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(std::greater<int>) (std::pair<int, std::pair<int, char> >&, std::pair<int, std::pair<int, char> >&)'
       else if (__comp(*__b, *__c))
                                 ^
In file included from /usr/include/c++/4.8/string:48:0,
                 from /usr/include/c++/4.8/bits/locale_classes.h:40,
                 from /usr/include/c++/4.8/bits/ios_base.h:41,
                 from /usr/include/c++/4.8/ios:42,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from aliniere.cpp:1:
/usr/include/c++/4.8/bits/stl_function.h:222:12: note: candidate is:
     struct greater : public binary_function<_Tp, _Tp, bool>
            ^
/usr/include/c++/4.8/bits/stl_function.h:225:7: note: bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int]
       operator()(const _Tp& __x, const _Tp& __y) const
       ^
/usr/include/c++/4.8/bits/stl_function.h:225:7: note:   no known conversion for argument 1 from 'std::pair<int, std::pair<int, char> >' to 'const int&'
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from aliniere.cpp:2:
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of '_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, _Compare) [with _RandomAccessIterator = std::pair<int, std::pair<int, char> >*; _Tp = std::pair<int, std::pair<int, char> >; _Compare = std::greater<int>]':
/usr/include/c++/4.8/bits/stl_algo.h:2296:78:   required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::pair<int, std::pair<int, char> >*; _Compare = std::greater<int>]'
/usr/include/c++/4.8/bits/stl_algo.h:2337:62:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = std::pair<int, std::pair<int, char> >*; _Size = int; _Compare = std::greater<int>]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = std::pair<int, std::pair<int, char> >*; _Compare = std::greater<int>]'
aliniere.cpp:25:42:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(std::greater<int>) (std::pair<int, std::pair<int, char> >&, const std::pair<int, std::pair<int, char> >&)'
    while (__comp(*__first, __pivot))
                                   ^
In file included from /usr/include/c++/4.8/string:48:0,
                 from /usr/include/c++/4.8/bits/locale_classes.h:40,
                 from /usr/include/c++/4.8/bits/ios_base.h:41,
                 from /usr/include/c++/4.8/ios:42,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from aliniere.cpp:1:
/usr/include/c++/4.8/bits/stl_function.h:222:12: note: candidate is:
     struct greater : public binary_function<_Tp, _Tp, bool>
            ^
/usr/include/c++/4.8/bits/stl_function.h:225:7: note: bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int]
       operator()(const _Tp& __x, const _Tp& __y) const
       ^
/usr/include/c++/4.8/bits/stl_function.h:225:7: note:   no known conversion for argument 1 from 'std::pair<int, std::pair<int, char> >' to 'const int&'
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from aliniere.cpp:2:
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(std::greater<int>) (const std::pair<int, std::pair<int, char> >&, std::pair<int, std::pair<int, char> >&)'
    while (__comp(__pivot, *__last))
                                  ^
In file included from /usr/include/c++/4.8/string:48:0,
                 from /usr/include/c++/4.8/bits/locale_classes.h:40,
                 from /usr/include/c++/4.8/bits/ios_base.h:41,
                 from /usr/include/c++/4.8/ios:42,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from aliniere.cpp:1:
/usr/include/c++/4.8/bits/stl_function.h:222:12: note: candidate is:
     struct greater : public binary_function<_Tp, _Tp, bool>
            ^
/usr/include/c++/4.8/bits/stl_function.h:225:7: note: bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int]
       operator()(const _Tp& __x, const _Tp& __y) const
       ^
/usr/include/c++/4.8/bits/stl_function.h:225:7: note:   no known conversion for argument 1 from 'const std::pair<int, std::pair<int, char> >' to 'const 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 aliniere.cpp:2:
/usr/include/c++/4.8/bits/stl_heap.h: In instantiation of 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = std::pair<int, std::pair<int, char> >*; _Distance = int; _Tp = std::pair<int, std::pair<int, char> >; _Compare = std::greater<int>]':
/usr/include/c++/4.8/bits/stl_heap.h:448:15:   required from 'void std::make_heap(_RAIter, _RAIter, _Compare) [with _RAIter = std::pair<int, std::pair<int, char> >*; _Compare = std::greater<int>]'
/usr/include/c++/4.8/bits/stl_algo.h:1946:47:   required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::pair<int, std::pair<int, char> >*; _Compare = std::greater<int>]'
/usr/include/c++/4.8/bits/stl_algo.h:5349:59:   required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = std::pair<int, std::pair<int, char> >*; _Compare = std::greater<int>]'
/usr/include/c++/4.8/bits/stl_algo.h:2332:68:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = std::pair<int, std::pair<int, char> >*; _Size = int; _Compare = std::greater<int>]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = std::pair<int, std::pair<int, char> >*; _Compare = std::greater<int>]'
aliniere.cpp:25:42:   required from here
/usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(std::greater<int>) (std::pair<int, std::pair<int, char> >&, std::pair<int, std::pair<int, char> >&)'
        *(__first + (__secondChild - 1))))
                                        ^
In file included from /usr/include/c++/4.8/string:48:0,
                 from /usr/include/c++/4.8/bits/locale_classes.h:40,
                 from /usr/include/c++/4.8/bits/ios_base.h:41,
                 from /usr/include/c++/4.8/ios:42,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from aliniere.cpp:1:
/usr/include/c++/4.8/bits/stl_function.h:222:12: note: candidate is:
     struct greater : public binary_function<_Tp, _Tp, bool>
            ^
/usr/include/c++/4.8/bits/stl_function.h:225:7: note: bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int]
       operator()(const _Tp& __x, const _Tp& __y) const
       ^
/usr/include/c++/4.8/bits/stl_function.h:225:7: note:   no known conversion for argument 1 from 'std::pair<int, std::pair<int, char> >' to 'const int&'

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 Aliniere 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ă.