Priority queue #1

#include <iostream>
#include <queue>

using namespace std;
priority_queue <int> q;

int main()
{
    for(int i = 1; i <= 10; i++)
        q.push(i * i % 13);
    while(!q.empty())
    {
        cout << q.top() << " "; // afiseaza elementul maxim din q
        q.pop(); // sterge din q elementul maxim
    }
    return 0;
}