Queuing The Stacks - Vaibhav

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include<queue>
using namespace std;


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    int t;
    cin>>t;
    while(t--){
        int n;
        cin>>n;
        vector<int>nums;
        for(int i=0;i<n;i++){
            int val;
            cin>>val;
            nums.push_back(val);
        }
        sort(nums.begin(),nums.end());
        queue<int> q;
        for(int i = 0 ; i < n ; i++){
            q.push(i);
        }
        vector<int> ans(n);
        for(int i=0; i<n; i++){
            ans[q.front()] = nums[i];
            q.pop();
            int t = q.front();
            q.pop();
            q.push(t);
        }
        for(int i=0;i<n;i++){
            cout<<ans[i]<<' ';
        }
        cout<<endl;
    }
    return 0;
}