#include <queue>
template <typename T>
bool contains(std::priority_queue<T> &q, T val) {
for (int i = 0; i < q.size(); i++) {
if (q.top() == val) return true;
q.pop();
}
return false;
}
#include <iostream>
int main()
{
std::priority_queue<int> q;
for (int i = 0; i<10; ++i) q.push(i);
std::cout << std::boolalpha;
std::cout << contains(q, 5) << std::endl;
}
I2luY2x1ZGUgPHF1ZXVlPgoKdGVtcGxhdGUgPHR5cGVuYW1lIFQ+CmJvb2wgY29udGFpbnMoc3RkOjpwcmlvcml0eV9xdWV1ZTxUPiAmcSwgVCB2YWwpIHsKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgcS5zaXplKCk7IGkrKykgewogICAgICAgIGlmIChxLnRvcCgpID09IHZhbCkgcmV0dXJuIHRydWU7CiAgICAgICAgcS5wb3AoKTsKICAgIH0KICAgIHJldHVybiBmYWxzZTsKfQojaW5jbHVkZSA8aW9zdHJlYW0+CgppbnQgbWFpbigpCnsKICBzdGQ6OnByaW9yaXR5X3F1ZXVlPGludD4gcTsKICBmb3IgKGludCBpID0gMDsgaTwxMDsgKytpKSBxLnB1c2goaSk7CiAgc3RkOjpjb3V0IDw8IHN0ZDo6Ym9vbGFscGhhOyAKICBzdGQ6OmNvdXQgPDwgY29udGFpbnMocSwgNSkgPDwgc3RkOjplbmRsOwp9Cg==