I was just wondering...How do you find an element in a priority queue if you only know its value with a time complexity of O(1)? Not wanting to bother anyone... plz inform me if it's currently not possible.

You can't - at least not with std::priority_queue.
A queue lets you read or remove the first element.

Thanks. Guess I'll just need to find another way of doing it.

What's the context in which you want to do this?

@seeplus
It's just a problem on our online judge which I wanted to solve, but got loony with the desperation. And I've solved it now, so it doesn't matter.