sortとpriority_queueの並び変え順序

 
#include <stdlib.h>
#include <time.h>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    vector<int> v;
    priority_queue<int> que;
    srand((unsigned long)time(NULL));
    for(int i=0; i<10; i++) {
        int x = rand() % 100;
        v.push_back(x);
        que.push(x);
    }

    std::sort(v.begin(), v.end());
    
    for(int i=0; i<10; i++) {
        printf("%2d %2d\n", v[i], que.top());
        que.pop();
    }
}

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Random;

public class SortVsQueue {
    public static void main(String... args) {
        new SortVsQueue();
    }

    public SortVsQueue() {
        PriorityQueue<Integer> que = new PriorityQueue<>();
        List<Integer> list = new ArrayList<>();

        Random rand = new Random(System.currentTimeMillis());
        for(int i=0; i<10; i++) {
            int x = rand.nextInt(100);
            list.add(x);
            que.add(x);
        }

        Collections.sort(list);
        for(int i=0; i<10; i++) {
            System.out.printf("%2d %2d\n", list.get(i), que.poll());
        }
    }
}