#2736
Baza De Date
Se citește numărul n
și apoi n
articole cu structura prenume nume salariu vârstă funcție număr_de_telefon email
. Fiecare articol este plasat pe câte o linie, câmpurile sale fiind separate prin câte un spațiu. Câmpurile salariu
și vârstă
conțin numere naturale, celelalte conțin șiruri de caractere.
Se citește apoi un număr natural p
cuprins între 1
și 7
și un caracter c
care poate fi +
sau -
.
Se cere ordonarea celor n
articole în funcție de p
și c
, astfel:
p=1
, ordonarea se face după prenume
; dacă p=2
, ordonarea se face după nume
; dacă p=3
, ordonarea se face după salariu
; dacă p=4
, ordonarea se face după vârstă
; dacă p=5
, ordonarea se face după funcție
; dacă p=6
, ordonarea se face după număr_de_telefon
; dacă p=7
, ordonarea se face după email
;c
are valoarea +
, ordonarea va fi crescătoare, iar dacă c
are valoarea -
, ordonarea va fi descrescătoare;Problema | Baza De Date | Operații I/O |
![]() |
---|---|---|---|
Limita timp | 0.01 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #58601018 | Utilizator | |
Fișier | baza_de_date.cpp | Dimensiune | 1.78 KB |
Data încărcării | 28 Iunie 2025, 13:14 | Scor / rezultat | Eroare de compilare |
baza_de_date.cpp: In function 'int main()': baza_de_date.cpp:64:25: warning: capture of variable 'p' with non-automatic storage duration [enabled by default] sort(a, a + n, [p]( Angajat &x, Angajat &y) { ^ baza_de_date.cpp:5:7: note: 'int p' declared here int n,p; ^ baza_de_date.cpp:68:25: warning: capture of variable 'p' with non-automatic storage duration [enabled by default] sort(a, a + n, [p]( Angajat &x, Angajat &y) { ^ baza_de_date.cpp:5:7: note: 'int p' declared here int n,p; ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from baza_de_date.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of '_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, _Compare) [with _RandomAccessIterator = Angajat*; _Tp = Angajat; _Compare = main()::__lambda4]': /usr/include/c++/4.8/bits/stl_algo.h:2296:78: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = Angajat*; _Compare = main()::__lambda4]' /usr/include/c++/4.8/bits/stl_algo.h:2337:62: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = Angajat*; _Size = int; _Compare = main()::__lambda4]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = Angajat*; _Compare = main()::__lambda4]' baza_de_date.cpp:66:10: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda4) (Angajat&, const Angajat&)' while (__comp(*__first, __pivot)) ^ baza_de_date.cpp:64:26: note: candidates are: sort(a, a + n, [p]( Angajat &x, Angajat &y) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from baza_de_date.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: bool (*)(Angajat&, Angajat&) <conversion> while (__comp(*__first, __pivot)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: candidate expects 3 arguments, 3 provided baza_de_date.cpp:64:52: note: main()::__lambda4 sort(a, a + n, [p]( Angajat &x, Angajat &y) { ^ baza_de_date.cpp:64:52: note: no known conversion for argument 2 from 'const Angajat' to 'Angajat&' In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from baza_de_date.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda4) (const Angajat&, Angajat&)' while (__comp(__pivot, *__last)) ^ baza_de_date.cpp:64:26: note: candidates are: sort(a, a + n, [p]( Angajat &x, Angajat &y) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from baza_de_date.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: bool (*)(Angajat&, Angajat&) <conversion> while (__comp(__pivot, *__last)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: candidate expects 3 arguments, 3 provided baza_de_date.cpp:64:52: note: main()::__lambda4 sort(a, a + n, [p]( Angajat &x, Angajat &y) { ^ baza_de_date.cpp:64:52: note: no known conversion for argument 1 from 'const Angajat' to 'Angajat&' In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from baza_de_date.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of '_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, _Compare) [with _RandomAccessIterator = Angajat*; _Tp = Angajat; _Compare = main()::__lambda5]': /usr/include/c++/4.8/bits/stl_algo.h:2296:78: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = Angajat*; _Compare = main()::__lambda5]' /usr/include/c++/4.8/bits/stl_algo.h:2337:62: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = Angajat*; _Size = int; _Compare = main()::__lambda5]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = Angajat*; _Compare = main()::__lambda5]' baza_de_date.cpp:70:10: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda5) (Angajat&, const Angajat&)' while (__comp(*__first, __pivot)) ^ baza_de_date.cpp:68:26: note: candidates are: sort(a, a + n, [p]( Angajat &x, Angajat &y) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from baza_de_date.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: bool (*)(Angajat&, Angajat&) <conversion> while (__comp(*__first, __pivot)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: candidate expects 3 arguments, 3 provided baza_de_date.cpp:68:52: note: main()::__lambda5 sort(a, a + n, [p]( Angajat &x, Angajat &y) { ^ baza_de_date.cpp:68:52: note: no known conversion for argument 2 from 'const Angajat' to 'Angajat&' In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from baza_de_date.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda5) (const Angajat&, Angajat&)' while (__comp(__pivot, *__last)) ^ baza_de_date.cpp:68:26: note: candidates are: sort(a, a + n, [p]( Angajat &x, Angajat &y) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from baza_de_date.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: bool (*)(Angajat&, Angajat&) <conversion> while (__comp(__pivot, *__last)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: candidate expects 3 arguments, 3 provided baza_de_date.cpp:68:52: note: main()::__lambda5 sort(a, a + n, [p]( Angajat &x, Angajat &y) { ^ baza_de_date.cpp:68:52: note: no known conversion for argument 1 from 'const Angajat' to 'Angajat&'
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Baza De Date face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
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ă.