fork download
  1. #include <queue>
  2.  
  3. template <typename T>
  4. bool contains(std::priority_queue<T> &q, T val) {
  5. for (int i = 0; i < q.size(); i++) {
  6. if (q.top() == val) return true;
  7. q.pop();
  8. }
  9. return false;
  10. }
  11. #include <iostream>
  12.  
  13. int main()
  14. {
  15. std::priority_queue<int> q;
  16. for (int i = 0; i<10; ++i) q.push(i);
  17. std::cout << std::boolalpha;
  18. std::cout << contains(q, 5) << std::endl;
  19. }
  20.  
Success #stdin #stdout 0s 2984KB
stdin
Standard input is empty
stdout
true