#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define f(i,a,b) for (int i = a; i <= b; i++)

using namespace std;

class Solution
{
public:
    void wiggleSort(vector<int> &nums)
    {
        int N = nums.size();
        vector<int> A = nums;
        sort(all(A));

        int i = 0;
        for(int p = 0; p < N; p += 2)
        {
            nums[p] = A[i];
            i++;
        }
        for(int p = 1; p < N; p += 2)
        {
            nums[p] = A[i];
            i++;
        }
    }
};