Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.

Detalii evaluare #64344610

Rezumat problemă

Sort_Indici
#1911

Se dă un vector cu n elemente, numere naturale. Afișați în ordine crescătoare elementele iar după fiecare element, inserați indicele poziției pe care acesta se afla înainte ca vectorul să fie sortat.

Consola Horia Apostol (ApostolHoria) Horia Apostol medie
Clasa 9 Tablouri unidimensionale (vectori) Sortarea vectorilor
Rezolvă

Detalii

Problema Sort_Indici Operații I/O tastatură/ecran
Limita timp 0.1 secunde Limita memorie Total: 64 MB / Stivă 8 MB
Id soluție #64344610 Utilizator nicoara calin (catalinpro123)
Fișier sort_indici.cpp Dimensiune 547 B
Data încărcării 30 Aprilie 2026, 17:32 Scor/rezultat Eroare de compilare

Evaluare

Mesaj compilare

sort_indici.cpp: In function ‘int main()’:
sort_indici.cpp:18:33: error: use of ‘auto’ in lambda parameter declaration only available with ‘-std=c++14’ or ‘-std=gnu++14’
   18 |     sort(v.begin(), v.end(), [](auto a, auto b) {
      |                                 ^~~~
sort_indici.cpp:18:41: error: use of ‘auto’ in lambda parameter declaration only available with ‘-std=c++14’ or ‘-std=gnu++14’
   18 |     sort(v.begin(), v.end(), [](auto a, auto b) {
      |                                         ^~~~
sort_indici.cpp: In lambda function:
sort_indici.cpp:19:15: error: request for member ‘first’ in ‘a’, which is of non-class type ‘int’
   19 |         if (a.first != b.first)
      |               ^~~~~
sort_indici.cpp:19:26: error: request for member ‘first’ in ‘b’, which is of non-class type ‘int’
   19 |         if (a.first != b.first)
      |                          ^~~~~
sort_indici.cpp:20:22: error: request for member ‘first’ in ‘a’, which is of non-class type ‘int’
   20 |             return a.first < b.first;
      |                      ^~~~~
sort_indici.cpp:20:32: error: request for member ‘first’ in ‘b’, which is of non-class type ‘int’
   20 |             return a.first < b.first;
      |                                ^~~~~
sort_indici.cpp:21:18: error: request for member ‘second’ in ‘a’, which is of non-class type ‘int’
   21 |         return a.second < b.second;
      |                  ^~~~~~
sort_indici.cpp:21:29: error: request for member ‘second’ in ‘b’, which is of non-class type ‘int’
   21 |         return a.second < b.second;
      |                             ^~~~~~
In file included from /usr/include/c++/13/bits/stl_algobase.h:71,
                 from /usr/include/c++/13/string:51,
                 from /usr/include/c++/13/bits/locale_classes.h:40,
                 from /usr/include/c++/13/bits/ios_base.h:41,
                 from /usr/include/c++/13/ios:44,
                 from /usr/include/c++/13/ostream:40,
                 from /usr/include/c++/13/iostream:41,
                 from sort_indici.cpp:1:
/usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Iter_comp_iter<_Compare>::operator()(_Iterator1, _Iterator2) [with _Iterator1 = __gnu_cxx::__normal_iterator<std::pair<long long int, int>*, std::vector<std::pair<long long int, int> > >; _Iterator2 = __gnu_cxx::__normal_iterator<std::pair<long long int, int>*, std::vector<std::pair<long long int, int> > >; _Compare = main()::<lambda(int, int)>]’:
/usr/include/c++/13/bits/stl_algo.h:1819:14:   required from ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<long long int, int>*, vector<pair<long long int, int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int, int)> >]’
/usr/include/c++/13/bits/stl_algo.h:1859:25:   required from ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<long long int, int>*, vector<pair<long long int, int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int, int)> >]’
/usr/include/c++/13/bits/stl_algo.h:1950:31:   required from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<long long int, int>*, vector<pair<long long int, int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int, int)> >]’
/usr/include/c++/13/bits/stl_algo.h:4894:18:   required from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<long long int, int>*, vector<pair<long long int, int> > >; _Compare = main()::<lambda(int, int)>]’
sort_indici.cpp:18:9:   required from here
/usr/include/c++/13/bits/predefined_ops.h:158:30: error: no match for call to ‘(main()::<lambda(int, int)>) (std::pair<long long int, int>&, std::pair<long long int, int>&)’
  158 |         { return bool(_M_comp(*__it1, *__it2)); }
      |                       ~~~~~~~^~~~~~~~~~~~~~~~
sort_indici.cpp:18:30: note: candidate: ‘main()::<lambda(int, int)>’
   18 |     sort(v.begin(), v.end(), [](auto a, auto b) {
      |                              ^
sort_indici.cpp:18:30: note:   no known conversion for argument 1 from ‘std::pair<long long int, int>’ to ‘int’
/usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Val_comp_iter<_Compare>::operator()(_Value&, _Iterator) [with _Value = std::pair<long long int, int>; _Iterator = __gnu_cxx::__normal_iterator<std::pair<long long int, int>*, std::vector<std::pair<long long int, int> > >; _Compare = main()::<lambda(int, int)>]’:
/usr/include/c++/13/bits/stl_algo.h:1799:20:   required from ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<long long int, int>*, vector<pair<long long int, int> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<main()::<lambda(int, int)> >]’
/usr/include/c++/13/bits/stl_algo.h:1827:36:   required from ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<long long int, int>*, vector<pair<long long int, int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int, int)> >]’
/usr/include/c++/13/bits/stl_algo.h:1859:25:   required from ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<long long int, int>*, vector<pair<long long int, int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int, int)> >]’
/usr/include/c++/13/bits/stl_algo.h:1950:31:   required from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<long long int, int>*, vector<pair<long long int, int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int, int)> >]’
/usr/include/c++/13/bits/stl_algo.h:4894:18:   required from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<long long int, int>*, vector<pair<long long int, int> > >; _Compare = main()::<lambda(int, int)>]’
sort_indici.cpp:18:9:   required from here
/usr/include/c++/13/bits/predefined_ops.h:240:30: error: no match for call to ‘(main()::<lambda(int, int)>) (std::pair<long long int, int>&, std::pair<long long int, int>&)’
  240 |         { return bool(_M_comp(__val, *__it)); }
      |                       ~~~~~~~^~~~~~~~~~~~~~
sort_indici.cpp:18:30: note: candidate: ‘main()::<lambda(int, int)>’
   18 |     sort(v.begin(), v.end(), [](auto a, auto b) {
      |                              ^
sort_indici.cpp:18:30: note:   no known conversion for argument 1 from ‘std::pair<long long int, int>’ to ‘int’
/usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<std::pair<long long int, int>*, std::vector<std::pair<long long int, int> > >; _Value = std::pair<long long int, int>; _Compare = main()::<lambda(int, int)>]’:
/usr/include/c++/13/bits/stl_heap.h:140:48:   required from ‘void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<long long int, int>*, vector<pair<long long int, int> > >; _Distance = long int; _Tp = pair<long long int, int>; _Compare = __gnu_cxx::__ops::_Iter_comp_val<main()::<lambda(int, int)> >]’
/usr/include/c++/13/bits/stl_heap.h:247:23:   required from ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<long long int, int>*, vector<pair<long long int, int> > >; _Distance = long int; _Tp = pair<long long int, int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int, int)> >]’
/usr/include/c++/13/bits/stl_heap.h:356:22:   required from ‘void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<long long int, int>*, vector<pair<long long int, int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int, int)> >]’
/usr/include/c++/13/bits/stl_algo.h:1635:23:   required from ‘void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<long long int, int>*, vector<pair<long long int, int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int, int)> >]’
/usr/include/c++/13/bits/stl_algo.h:1910:25:   required from ‘void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<long long int, int>*, vector<pair<long long int, int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int, int)> >]’
/usr/include/c++/13/bits/stl_algo.h:1926:27:   required from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<long long int, int>*, vector<pair<long long int, int> > >; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int, int)> >]’
/usr/include/c++/13/bits/stl_algo.h:1947:25:   required from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<long long int, int>*, vector<pair<long long int, int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int, int)> >]’
/usr/include/c++/13/bits/stl_algo.h:4894:18:   required from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<long long int, int>*, vector<pair<long long int, int> > >; _Compare = main()::<lambda(int, int)>]’
sort_indici.cpp:18:9:   required from here
/usr/include/c++/13/bits/predefined_ops.h:196:30: error: no match for call to ‘(main()::<lambda(int, int)>) (std::pair<long long int, int>&, std::pair<long long int, int>&)’
  196 |         { return bool(_M_comp(*__it, __val)); }
      |                       ~~~~~~~^~~~~~~~~~~~~~
sort_indici.cpp:18:30: note: candidate: ‘main()::<lambda(int, int)>’
   18 |     sort(v.begin(), v.end(), [](auto a, auto b) {
      |                              ^
sort_indici.cpp:18:30: note:   no known conversion for argument 1 from ‘std::pair<long long int, int>’ to ‘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 Sort_Indici 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ă.

Du-te sus!