Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <queue>
- struct datos {
- int n, m;
- };
- bool operator<(const datos& a, const datos& b) {
- return a.n < b.n; // ordenando por n de menor a mayor, entonces en la cima del montículo estará el elemento con mayor n
- }
- int main( ) {
- std::priority_queue<datos> q;
- q.push(datos{5, 7});
- q.push(datos{2, 10});
- q.push(datos{9, 3});
- q.push(datos{6, 5});
- while (!q.empty( )) {
- auto actual = q.top( );
- std::cout << actual.n << " " << actual.m << "n";
- q.pop( );
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement