Rezumat problemă

Partitionare

#2594

Se citește un număr natural n și un șir de n numere întregi. Să se aranjeze elementele astfel încât în prima parte a șirului să fie valorile pare în ordine crescătoare, iar în partea a doua valorile impare, de asemenea în ordine crescătoare.

Consola Andrei Visalon (Prekzursil) Mirela Mlisan, Andrei Visalon medie

Clasa 9 Tablouri unidimensionale (vectori) Sortarea vectorilor

Rezolvă

Detalii

Problema	Partitionare	Operații I/O	tastatură/ecran
Limita timp	0.01 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#64919753	Utilizator	Ilie Andrei (Ilie_Andrei)
Fișier	partitionare.cpp	Dimensiune	605 B
Data încărcării	13 Iunie 2026, 14:34	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

partitionare.cpp: In function ‘int main()’:
partitionare.cpp:20:9: error: no matching function for call to ‘sort(<unresolved overloaded function type>, <unresolved overloaded function type>)’
   20 |     sort(par.begin, par.end);
      |     ~~~~^~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:61,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51,
                 from partitionare.cpp:1:
/usr/include/c++/13/bits/stl_algo.h:4851:5: note: candidate: ‘template<class _RAIter> void std::sort(_RAIter, _RAIter)’
 4851 |     sort(_RandomAccessIterator __first, _RandomAccessIterator __last)
      |     ^~~~
/usr/include/c++/13/bits/stl_algo.h:4851:5: note:   template argument deduction/substitution failed:
partitionare.cpp:20:9: note:   couldn’t deduce template parameter ‘_RAIter’
   20 |     sort(par.begin, par.end);
      |     ~~~~^~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:4882:5: note: candidate: ‘template<class _RAIter, class _Compare> void std::sort(_RAIter, _RAIter, _Compare)’
 4882 |     sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
      |     ^~~~
/usr/include/c++/13/bits/stl_algo.h:4882:5: note:   template argument deduction/substitution failed:
partitionare.cpp:20:9: note:   candidate expects 3 arguments, 2 provided
   20 |     sort(par.begin, par.end);
      |     ~~~~^~~~~~~~~~~~~~~~~~~~
partitionare.cpp:21:9: error: no matching function for call to ‘sort(<unresolved overloaded function type>, <unresolved overloaded function type>)’
   21 |     sort(impar.begin, impar.end);
      |     ~~~~^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:4851:5: note: candidate: ‘template<class _RAIter> void std::sort(_RAIter, _RAIter)’
 4851 |     sort(_RandomAccessIterator __first, _RandomAccessIterator __last)
      |     ^~~~
/usr/include/c++/13/bits/stl_algo.h:4851:5: note:   template argument deduction/substitution failed:
partitionare.cpp:21:9: note:   couldn’t deduce template parameter ‘_RAIter’
   21 |     sort(impar.begin, impar.end);
      |     ~~~~^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:4882:5: note: candidate: ‘template<class _RAIter, class _Compare> void std::sort(_RAIter, _RAIter, _Compare)’
 4882 |     sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
      |     ^~~~
/usr/include/c++/13/bits/stl_algo.h:4882:5: note:   template argument deduction/substitution failed:
partitionare.cpp:21:9: note:   candidate expects 3 arguments, 2 provided
   21 |     sort(impar.begin, impar.end);
      |     ~~~~^~~~~~~~~~~~~~~~~~~~~~~~
partitionare.cpp:22:23: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   22 |     for(int i = 0 ; i < par.size() ; i++){
      |                     ~~^~~~~~~~~~~~
partitionare.cpp:25:23: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   25 |     for(int i = 0 ; i < impar.size() ; i++){
      |                     ~~^~~~~~~~~~~~~~

Cum funcționează evaluarea?