1
class Solution {
2
 public:
3
  vector<int> sortArray(vector<int> &nums) {
4
    priority_queue<int, vector<int>, greater<int>> pq;
5
    for (auto it : nums) {
6
      pq.push(it);
7
    }
8
    vector<int> ans;
9
    while (!pq.empty()) {
10
      ans.push_back(pq.top());
11
      pq.pop();
12
    }
13

14
    return ans;
15
  }
16
};