오름차순, 내림차순

#include <queue>

int main() {

    priority_queue< int, vector<int>, less<int> > arr1;
    priority_queue< int, vector<int>, greater<int> > arr2;

    for (int i = 0; i < 10; i++) {
        arr1.push(i);
        arr2.push(i);
    }

    printf("arr1 : ");
    for (int i = 0; i < 10; i++) {
        printf(" %d ", arr1.top());
        arr1.pop();
    }
    printf("\n");

    printf("arr2 : ");
    for (int i = 0; i < 10; i++) {
        printf(" %d ", arr2.top());
        arr2.pop();
    }
   
    return 0;
}

// 출력
// arr1 :  9  8  7  6  5  4  3  2  1  0 
// arr2 :  0  1  2  3  4  5  6  7  8  9