Use a priority queue of size n to develop an algorithm that prints out all integers of the form a³+ b³ where a and b are integers between 0 and n in sorted order, without using excessive space. Using c++

Don't solve if u don't know it correctly. I will surely downvote it.

I need it. Please solve asap.