| Problem | monsters |
|---|---|
| User | Josh28acc2 |
| Submission Time | 2024-02-02 23:20:31 |
| Score | 0 |
| Max Time | N/A |
| Max Memory | N/A |
Owl Get a Life
monsters.cpp: In function ‘void solve()’:
monsters.cpp:110:36: error: no matching function for call to ‘std::priority_queue<std::pair<long long int, long long int>, std::vector<std::pair<long long int, long long int> >, std::greater<std::pair<long long int, long long int> > >::push(long long int&)’
110 | pq.push(arr[cnt].second); cnt++;
| ^
In file included from /usr/include/c++/9/queue:64,
from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:86,
from monsters.cpp:61:
/usr/include/c++/9/bits/stl_queue.h:627:7: note: candidate: ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<long long int, long long int>; _Sequence = std::vector<std::pair<long long int, long long int> >; _Compare = std::greater<std::pair<long long int, long long int> >; std::priority_queue