Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #63337733
Rezumat problemă
#2057
Să ne imaginăm faptul că la un anumit liceu există doar două clase per generație: una de Real și una de Uman. În prezent au loc înscrierile pentru clasa a IX-a. Cele două clase au fiecare câte M locuri disponibile, atât la Real, cât și la Uman. Dacă lista de elevi înscriși la o anumită clasă conține mai mult de M elevi, vor fi admiși acei M elevi care au notele cele mai mari. Ambele clase au deja M elevi înscriși, iar pentru fiecare se știe nota cu care a fost înscris la clasa respectivă.
Mai există însă N elevi, singurii încă neînscriși, care sunt privilegiați în acest proces (fiindcă au terminat gimnaziul la acest liceu). Privilegiul lor constă în următorul fapt: ei se pot înscrie acum, după ce înscrierile publice au fost încheiate, și se cunosc notele de înscriere la ambele clase. Fiecare din cei N elevi are câte două note: nota cu care ar fi înscris la Real și nota cu care ar fi înscris la Uman (acestea pot fi diferite, deoarece examenele de admitere de la cele două clase diferă). Fiecare din cei N elevi va alege să se înscrie în maxim o clasă. Ei își vor coordona alegerile astfel încât să maximizeze numărul de elevi admiși. Deoarece calculele devin destul de complicate, aceștia s-ar putea folosi de ajutorul vostru. Ei doresc răspunsul la două întrebări.
(1) Care este numărul maxim de elevi privilegiaţi care pot fi admiși dacă se pune restricția suplimentară ca toți elevii privilegiați admiși să fie admiși la aceeași clasă?
(2) Care este numărul maxim de elevi privilegiaţi care pot fi admiși dacă aceștia se pot înscrie la clase diferite?
OJI 2017
Pracsiu Dan (dnprx) Detalii
| Problema | admitere | Operații I/O |
admitere.in/admitere.out
|
|---|---|---|---|
| Limita timp | 1.5 secunde | Limita memorie |
Total: 32 MB
/
Stivă 8 MB
|
| Id soluție | #63337733 | Utilizator |
n g (idkbro123)
|
| Fișier | admitere.cpp | Dimensiune | 2.53 KB |
| Data încărcării | 26 Februarie 2026, 18:07 | Scor/rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
admitere.cpp: In lambda function: admitere.cpp:32:43: error: parameter declared 'auto' sort(v.begin(), v.end(), [](auto &a, auto &b){ ^ admitere.cpp:32:52: error: parameter declared 'auto' sort(v.begin(), v.end(), [](auto &a, auto &b){ ^ admitere.cpp: In lambda function: admitere.cpp:33:27: error: 'a' was not declared in this scope return get<0>(a) > get<0>(b); ^ admitere.cpp:33:39: error: 'b' was not declared in this scope return get<0>(a) > get<0>(b); ^ admitere.cpp: In lambda function: admitere.cpp:38:18: error: expected unqualified-id before '[' token auto [sc,id,isP] = v[i]; ^ admitere.cpp:39:17: error: 'isP' was not declared in this scope if (isP) isAdm[id] = 1; ^ admitere.cpp:39:28: error: 'id' was not declared in this scope if (isP) isAdm[id] = 1; ^ 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 admitere.cpp:1: /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::tuple<int, int, bool>*, std::vector<std::tuple<int, int, bool> > >; _Compare = main()::__lambda4::__lambda5]': /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::tuple<int, int, bool>*, std::vector<std::tuple<int, int, bool> > >; _Compare = main()::__lambda4::__lambda5]' /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::tuple<int, int, bool>*, std::vector<std::tuple<int, int, bool> > >; _Compare = main()::__lambda4::__lambda5]' admitere.cpp:34:10: required from here /usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(main()::__lambda4::__lambda5) (std::tuple<int, int, bool>&, std::tuple<int, int, bool>&)' if (__comp(*__i, *__first)) ^ admitere.cpp:32:35: note: candidates are: sort(v.begin(), v.end(), [](auto &a, auto &b){ ^ 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 admitere.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:2159:29: note: void (*)() <conversion> if (__comp(*__i, *__first)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2159:29: note: candidate expects 1 argument, 3 provided admitere.cpp:32:53: note: main()::__lambda4::__lambda5 sort(v.begin(), v.end(), [](auto &a, auto &b){ ^ admitere.cpp:32:53: note: candidate expects 0 arguments, 2 provided 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 admitere.cpp:1: /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::tuple<int, int, bool>*, std::vector<std::tuple<int, int, bool> > >; _Compare = main()::__lambda4::__lambda5]': /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::tuple<int, int, bool>*, std::vector<std::tuple<int, int, bool> > >; _Compare = main()::__lambda4::__lambda5]' /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::tuple<int, int, bool>*, std::vector<std::tuple<int, int, bool> > >; _Size = int; _Compare = main()::__lambda4::__lambda5]' /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::tuple<int, int, bool>*, std::vector<std::tuple<int, int, bool> > >; _Compare = main()::__lambda4::__lambda5]' admitere.cpp:34:10: required from here /usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(main()::__lambda4::__lambda5) (std::tuple<int, int, bool>&, std::tuple<int, int, bool>&)' if (__comp(*__i, *__first)) ^ admitere.cpp:32:35: note: candidates are: sort(v.begin(), v.end(), [](auto &a, auto &b){ ^ 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 admitere.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:1948:27: note: void (*)() <conversion> if (__comp(*__i, *__first)) ^ /usr/include/c++/4.8/bits/stl_algo.h:1948:27: note: candidate expects 1 argument, 3 provided admitere.cpp:32:53: note: main()::__lambda4::__lambda5 sort(v.begin(), v.end(), [](auto &a, auto &b){ ^ admitere.cpp:32:53: note: candidate expects 0 arguments, 2 provided 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 admitere.cpp:1: /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::tuple<int, int, bool>*, std::vector<std::tuple<int, int, bool> > >; _Compare = main()::__lambda4::__lambda5]': /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::tuple<int, int, bool>*, std::vector<std::tuple<int, int, bool> > >; _Compare = main()::__lambda4::__lambda5]' /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::tuple<int, int, bool>*, std::vector<std::tuple<int, int, bool> > >; _Size = int; _Compare = main()::__lambda4::__lambda5]' /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::tuple<int, int, bool>*, std::vector<std::tuple<int, int, bool> > >; _Compare = main()::__lambda4::__lambda5]' admitere.cpp:34:10: required from here /usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(main()::__lambda4::__lambda5) (std::tuple<int, int, bool>&, std::tuple<int, int, bool>&)' if (__comp(*__a, *__b)) ^ admitere.cpp:32:35: note: candidates are: sort(v.begin(), v.end(), [](auto &a, auto &b){ ^ 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 admitere.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:114:28: note: void (*)() <conversion> if (__comp(*__a, *__b)) ^ /usr/include/c++/4.8/bits/stl_algo.h:114:28: note: candidate expects 1 argument, 3 provided admitere.cpp:32:53: note: main()::__lambda4::__lambda5 sort(v.begin(), v.end(), [](auto &a, auto &b){ ^ admitere.cpp:32:53: note: candidate expects 0 arguments, 2 provided 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 admitere.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(main()::__lambda4::__lambda5) (std::tuple<int, int, bool>&, std::tuple<int, int, bool>&)' if (__comp(*__b, *__c)) ^ admitere.cpp:32:35: note: candidates are: sort(v.begin(), v.end(), [](auto &a, auto &b){ ^ 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 admitere.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:116:25: note: void (*)() <conversion> if (__comp(*__b, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:116:25: note: candidate expects 1 argument, 3 provided admitere.cpp:32:53: note: main()::__lambda4::__lambda5 sort(v.begin(), v.end(), [](auto &a, auto &b){ ^ admitere.cpp:32:53: note: candidate expects 0 arguments, 2 provided 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 admitere.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(main()::__lambda4::__lambda5) (std::tuple<int, int, bool>&, std::tuple<int, int, bool>&)' else if (__comp(*__a, *__c)) ^ admitere.cpp:32:35: note: candidates are: sort(v.begin(), v.end(), [](auto &a, auto &b){ ^ 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 admitere.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:118:30: note: void (*)() <conversion> else if (__comp(*__a, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:118:30: note: candidate expects 1 argument, 3 provided admitere.cpp:32:53: note: main()::__lambda4::__lambda5 sort(v.begin(), v.end(), [](auto &a, auto &b){ ^ admitere.cpp:32:53: note: candidate expects 0 arguments, 2 provided 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 admitere.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(main()::__lambda4::__lambda5) (std::tuple<int, int, bool>&, std::tuple<int, int, bool>&)' else if (__comp(*__a, *__c)) ^ admitere.cpp:32:35: note: candidates are: sort(v.begin(), v.end(), [](auto &a, auto &b){ ^ 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 admitere.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:123:33: note: void (*)() <conversion> else if (__comp(*__a, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:123:33: note: candidate expects 1 argument, 3 provided admitere.cpp:32:53: note: main()::__lambda4::__lambda5 sort(v.begin(), v.end(), [](auto &a, auto &b){ ^ admitere.cpp:32:53: note: candidate expects 0 arguments, 2 provided 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 admitere.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(main()::__lambda4::__lambda5) (std::tuple<int, int, bool>&, std::tuple<int, int, bool>&)' else if (__comp(*__b, *__c)) ^ admitere.cpp:32:35: note: candidates are: sort(v.begin(), v.end(), [](auto &a, auto &b){ ^ 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 admitere.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:125:33: note: void (*)() <conversion> else if (__comp(*__b, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:125:33: note: candidate expects 1 argument, 3 provided admitere.cpp:32:53: note: main()::__lambda4::__lambda5 sort(v.begin(), v.end(), [](auto &a, auto &b){ ^ admitere.cpp:32:53: note: candidate expects 0 arguments, 2 provided 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 admitere.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 = __gnu_cxx::__normal_iterator<std::tuple<int, int, bool>*, std::vector<std::tuple<int, int, bool> > >; _Tp = std::tuple<int, int, bool>; _Compare = main()::__lambda4::__lambda5]': /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::tuple<int, int, bool>*, std::vector<std::tuple<int, int, bool> > >; _Compare = main()::__lambda4::__lambda5]' /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::tuple<int, int, bool>*, std::vector<std::tuple<int, int, bool> > >; _Size = int; _Compare = main()::__lambda4::__lambda5]' /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::tuple<int, int, bool>*, std::vector<std::tuple<int, int, bool> > >; _Compare = main()::__lambda4::__lambda5]' admitere.cpp:34:10: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda4::__lambda5) (std::tuple<int, int, bool>&, const std::tuple<int, int, bool>&)' while (__comp(*__first, __pivot)) ^ admitere.cpp:32:35: note: candidates are: sort(v.begin(), v.end(), [](auto &a, auto &b){ ^ 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 admitere.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: void (*)() <conversion> while (__comp(*__first, __pivot)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: candidate expects 1 argument, 3 provided admitere.cpp:32:53: note: main()::__lambda4::__lambda5 sort(v.begin(), v.end(), [](auto &a, auto &b){ ^ admitere.cpp:32:53: note: candidate expects 0 arguments, 2 provided 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 admitere.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda4::__lambda5) (const std::tuple<int, int, bool>&, std::tuple<int, int, bool>&)' while (__comp(__pivot, *__last)) ^ admitere.cpp:32:35: note: candidates are: sort(v.begin(), v.end(), [](auto &a, auto &b){ ^ 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 admitere.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: void (*)() <conversion> while (__comp(__pivot, *__last)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: candidate expects 1 argument, 3 provided admitere.cpp:32:53: note: main()::__lambda4::__lambda5 sort(v.begin(), v.end(), [](auto &a, auto &b){ ^ admitere.cpp:32:53: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from admitere.cpp:1: /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::tuple<int, int, bool>*, std::vector<std::tuple<int, int, bool> > >; _Distance = int; _Tp = std::tuple<int, int, bool>; _Compare = main()::__lambda4::__lambda5]': /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::tuple<int, int, bool>*, std::vector<std::tuple<int, int, bool> > >; _Compare = main()::__lambda4::__lambda5]' /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::tuple<int, int, bool>*, std::vector<std::tuple<int, int, bool> > >; _Compare = main()::__lambda4::__lambda5]' /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::tuple<int, int, bool>*, std::vector<std::tuple<int, int, bool> > >; _Compare = main()::__lambda4::__lambda5]' /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::tuple<int, int, bool>*, std::vector<std::tuple<int, int, bool> > >; _Size = int; _Compare = main()::__lambda4::__lambda5]' /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::tuple<int, int, bool>*, std::vector<std::tuple<int, int, bool> > >; _Compare = main()::__lambda4::__lambda5]' admitere.cpp:34:10: required from here /usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(main()::__lambda4::__lambda5) (std::tuple<int, int, bool>&, std::tuple<int, int, bool>&)' *(__first + (__secondChild - 1)))) ^ admitere.cpp:32:35: note: candidates are: sort(v.begin(), v.end(), [](auto &a, auto &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 /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from admitere.cpp:1: /usr/include/c++/4.8/bits/stl_heap.h:313:40: note: void (*)() <conversion> *(__first + (__secondChild - 1)))) ^ /usr/include/c++/4.8/bits/stl_heap.h:313:40: note: candidate expects 1 argument, 3 provided admitere.cpp:32:53: note: main()::__lambda4::__lambda5 sort(v.begin(), v.end(), [](auto &a, auto &b){ ^ admitere.cpp:32:53: note: candidate expects 0 arguments, 2 provided 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 admitere.cpp:1: /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::tuple<int, int, bool>*, std::vector<std::tuple<int, int, bool> > >; _Compare = main()::__lambda4::__lambda5]', declared using local type 'main()::__lambda4::__lambda5', 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 /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from admitere.cpp:1: /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::tuple<int, int, bool>*, std::vector<std::tuple<int, int, bool> > >; _Compare = main()::__lambda4::__lambda5]', declared using local type 'main()::__lambda4::__lambda5', 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::tuple<int, int, bool>*, std::vector<std::tuple<int, int, bool> > >; _Distance = int; _Tp = std::tuple<int, int, bool>; _Compare = main()::__lambda4::__lambda5]', declared using local type 'main()::__lambda4::__lambda5', is used but never defined [-fpermissive] __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, ^ admitere.cpp: In function 'int main()': admitere.cpp:8:39: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result] freopen("admitere.in", "r", stdin); ^ admitere.cpp:9:41: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result] freopen("admitere.out", "w", stdout); ^
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 admitere 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ă.