1
class Solution {
2
 public:
3
  void wiggleSort(vector<int> &nums) {
4
    priority_queue<int> pq;
5
    for (auto &i : nums) pq.push(i);
6

7
    for (int i = 1; i < nums.size(); i += 2) nums[i] = pq.top(), pq.pop();
8

9
    for (int i = 0; i < nums.size(); i += 2) nums[i] = pq.top(), pq.pop();
10
  }
11
};